Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,268,536 papers from all fields of science
Search
Sign In
Create Free Account
Transfinite interpolation
Known as:
Transfinite
In numerical analysis, transfinite interpolation is a means to construct functions over a planar domain in such a way that they match a given…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Finite element method
List of numerical analysis topics
Numerical analysis
Broader (1)
Interpolation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Positive provability logic for uniform reflection principles
L. Beklemishev
Annals of Pure and Applied Logic
2013
Corpus ID: 5954049
2009
2009
Nonlinear transient heat transfer and thermoelastic analysis of thick-walled FGM cylinder with temperature-dependent material properties using Hermitian transfinite element
M. Azadi
,
M. Azadi
2009
Corpus ID: 56021118
Nonlinear transient heat transfer and thermoelastic stress analyses of a thick-walled FGM cylinder with temperature-dependent…
Expand
Highly Cited
2008
Highly Cited
2008
Towards automatic structured multiblock mesh generation using improved transfinite interpolation
C. Allen
2008
Corpus ID: 62748890
The quality of any numerical flowfield solution is inextricably linked to the quality of the mesh used. It is normally accepted…
Expand
Highly Cited
2005
Highly Cited
2005
STATE UNIVERSITY OF NEW YORK AT STONY BROOK
A. Zemanian
2005
Corpus ID: 207844427
A new and considerably different analysis of a transportation network is presented, wherein a cammodity is supplied at a n~~ber…
Expand
Review
2004
Review
2004
A review of E infinity theory and the mass spectrum of high energy particle physics
M. Naschie
2004
Corpus ID: 56570063
Highly Cited
1999
Highly Cited
1999
New Directions in Descriptive Set Theory
A. Kechris
Bulletin of Symbolic Logic
1999
Corpus ID: 18458577
§1. I will start with a quick definition of descriptive set theory: It is the study of the structure of definable sets and…
Expand
1988
1988
CAL: A Theoretical Background of Constraint Logic Programming and its Applications
K. Sakai
,
A. Aiba
Journal of symbolic computation
1988
Corpus ID: 6261872
Highly Cited
1984
Highly Cited
1984
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
C. Jockusch
,
R. Shore
Journal of Symbolic Logic (JSL)
1984
Corpus ID: 28946399
In this paper we introduce a new hierarchy of sets and operators which we call the REA hierarchy for “recursively enumerable in…
Expand
Highly Cited
1981
Highly Cited
1981
A general two‐dimensional, graphical finite element preprocessor utilizing discrete transfinite mappings
R. Haber
,
M. Shephard
,
J. Abel
,
R. Gallagher
,
D. Greenberg
1981
Corpus ID: 62666362
Finite element preprocessor programs have been developed in recent years in order to expedite the task of data preparation. A key…
Expand
1972
1972
A Theorem on Families of Sets
B. Lindström
Journal of combinatorial theory. Series A
1972
Corpus ID: 33564388
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE