On the public citation graph
Estimation of convergence orders in repeated richardson extrapolation
0 signed · 22 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01930850openalex-snapshot
Generalized neville type extrapolation schemes
inferredcites →https://doi.org/10.1137/0704008openalex-snapshot
Approximations and Bounds for Eigenvalues of Elliptic Operators
inferredcites →https://doi.org/10.1512/iumj.1959.8.58047openalex-snapshot
Developments at an Analytic Corner of Solutions of Elliptic Partial Differential Equations
inferredcites →https://doi.org/10.2307/2007352openalex-snapshot
Sequence Transformations and their Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-11539-5_11openalex-snapshot
Stability Properties of Repeated Richardson Extrapolation Applied Together with Some Implicit Runge-Kutta Methods
inferred← citeshttps://doi.org/10.1007/s10910-021-01300-zopenalex-snapshot
Efficient implementation of advanced Richardson Extrapolation in an atmospheric chemical scheme
inferred← citeshttps://doi.org/10.1016/0377-0427(90)90370-fopenalex-snapshot
A simultaneous process for convergence acceleration and error control
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00031-uopenalex-snapshot
Limit analysis with the dual affine scaling algorithm
inferred← citeshttps://doi.org/10.1016/b978-0-12-784391-9.50161-5openalex-snapshot
Richardson Extrapolation
inferred← citeshttps://doi.org/10.1016/j.cam.2009.07.056openalex-snapshot
Sweeping algebraic curves for singular solutions
inferred← citeshttps://doi.org/10.1016/j.jcp.2015.12.059openalex-snapshot
High order eigenvalues for the Helmholtz equation in complicated non-tensor domains through Richardson extrapolation of second order finite differences
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00016-4openalex-snapshot
The Markov chain approximation approach for numerical solution of stochastic control problems: experiences from Merton’s problem
inferred← citeshttps://doi.org/10.1016/s1570-8659(96)80004-4openalex-snapshot
Limit analysis of collapse states
inferred← citeshttps://doi.org/10.1023/a:1019163811284openalex-snapshot
Polyhedral end games for polynomial continuation
inferred← citeshttps://doi.org/10.1137/140986025openalex-snapshot
Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling
inferred← citeshttps://doi.org/10.1137/s1064827594275303openalex-snapshot
Computing Limit Loads by Minimizing a Sum of Norms
inferred← citeshttps://doi.org/10.1155/2018/2730829openalex-snapshot
Robust Three-Dimensional Level-Set Method for Evolving Fronts on Complex Unstructured Meshes
inferred← citeshttps://doi.org/10.1515/cmam-2019-0016openalex-snapshot
Explicit Runge–Kutta Methods Combined with Advanced Versions of the Richardson Extrapolation
inferred← citeshttps://doi.org/10.3233/jifs-169177openalex-snapshot
Interpolation strategies in repeated Richardson extrapolation
inferred← citeshttps://doi.org/10.70675/0f42bda2z1fa0z4d6fz9f25zf50dd9905e82openalex-snapshot
Coupling Eulerian interface capturing and Lagrangian particle methods for atomization simulation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.