On the public citation graph

The conformal ‘bratwurst’ mapsand associated Faber polynomials

https://doi.org/10.1007/pl00005401
0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-0348-5812-0openalex-snapshot
Vorlesungen über Approximation im Komplexen
inferredcites →https://doi.org/10.1007/bf01112450openalex-snapshot
On faber polynomials and faber expansions
inferredcites →https://doi.org/10.1007/bf01279022openalex-snapshot
Chebyshev polynomials for disjoint compact sets
inferredcites →https://doi.org/10.1007/bf01385726openalex-snapshot
QMR: a quasi-minimal residual method for non-Hermitian linear systems
inferredcites →https://doi.org/10.1007/bf01388688openalex-snapshot
A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
inferredcites →https://doi.org/10.1007/bf01389449openalex-snapshot
On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type method
inferredcites →https://doi.org/10.1007/bf01389454openalex-snapshot
A study of semiiterative methods for nonsymmetric systems of linear equations
inferredcites →https://doi.org/10.1007/bf01409782openalex-snapshot
On semiiterative methods generated by Faber polynomials
inferredcites →https://doi.org/10.1007/bf01409784openalex-snapshot
Stationary and almost stationary iterative (k, l)-step methods for linear and nonlinear systems of equations
inferredcites →https://doi.org/10.1007/s002110050202openalex-snapshot
On hybrid iterative methods for nonsymmetric systems of linear equations
inferredcites →https://doi.org/10.1016/0021-9045(90)90054-topenalex-snapshot
On the constrained Chebyshev approximation problem on ellipses
inferredcites →https://doi.org/10.1016/0021-9045(91)90091-nopenalex-snapshot
Chebyshev polynomials are not always optimal
inferredcites →https://doi.org/10.1016/0377-0427(92)90006-jopenalex-snapshot
An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK
inferredcites →https://doi.org/10.1017/s0962492900002245openalex-snapshot
Iterative solution of linear systems
inferredcites →https://doi.org/10.1063/1.3048359openalex-snapshot
Theory of Functions of a Complex Variable
inferredcites →https://doi.org/10.1080/00029890.1971.11992813openalex-snapshot
Faber Polynomials and the Faber Series
inferredcites →https://doi.org/10.1090/coll/020openalex-snapshot
Interpolation and Approximation by Rational Functions in the Complex Domain
inferredcites →https://doi.org/10.1090/s0025-5718-1995-1260127-8openalex-snapshot
The Faber Polynomials for Annular Sectors
inferredcites →https://doi.org/10.1137/0613049openalex-snapshot
How Fast are Nonsymmetric Matrix Iterations?
inferredcites →https://doi.org/10.1137/0613050openalex-snapshot
A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1137/0712047openalex-snapshot
Solution of Sparse Indefinite Systems of Linear Equations
inferredcites →https://doi.org/10.1137/0720085openalex-snapshot
On the Construction of Semi-Iterative Methods
inferredcites →https://doi.org/10.1137/0724015openalex-snapshot
General k -Part Stationary Iterative Solutions to Linear Systems
inferredcites →https://doi.org/10.1137/0907057openalex-snapshot
A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
inferredcites →https://doi.org/10.1137/0907058openalex-snapshot
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1142/9789814533232_0020openalex-snapshot
Faber Versus Minimal Polynomials on Annular Sectors
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
inferredcites →https://doi.org/10.2307/2315931openalex-snapshot
Theory of Functions of a Complex Variable.
inferredcites →https://doi.org/10.2307/2323585openalex-snapshot
Applied and Computational Complex Analysis.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/gamm.201490008openalex-snapshot
Convergence analysis of Krylov subspace methods
inferred← citeshttps://doi.org/10.1007/s00211-004-0565-2openalex-snapshot
On the approximation order of extremal point methods for hyperbolic minimal energy problems
inferred← citeshttps://doi.org/10.1007/s003650010021openalex-snapshot
Faber polynomials corresponding to rational exterior mapping functions
inferred← citeshttps://doi.org/10.1007/s10444-022-09931-9openalex-snapshot
Applying GMRES to the Helmholtz equation with strong trapping: how does the number of iterations depend on the frequency?
inferred← citeshttps://doi.org/10.1007/s40315-016-0159-xopenalex-snapshot
Numerical Computation of the Conformal Map onto Lemniscatic Domains
inferred← citeshttps://doi.org/10.1007/s40315-016-0176-9openalex-snapshot
Properties and Examples of Faber–Walsh Polynomials
inferred← citeshttps://doi.org/10.1007/s40315-017-0207-1openalex-snapshot
Fast and Accurate Computation of the Logarithmic Capacity of Compact Sets
inferred← citeshttps://doi.org/10.1021/acs.jctc.1c00984openalex-snapshot
Excited-State DMRG Made Simple with FEAST
inferred← citeshttps://doi.org/10.1063/1.5068747openalex-snapshot
Optimization of highly excited matrix product states with an application to vibrational spectroscopy
inferred← citeshttps://doi.org/10.1137/07068607xopenalex-snapshot
New Quadrature Formulas from Conformal Maps
inferred← citeshttps://doi.org/10.1137/070699378openalex-snapshot
Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations
inferred← citeshttps://doi.org/10.1137/090753292openalex-snapshot
An Analysis of Equivalent Operator Preconditioning for Equation-Free Newton–Krylov Methods
inferred← citeshttps://doi.org/10.1137/s0895479898341669openalex-snapshot
Computable Convergence Bounds for GMRES
inferred← citeshttps://doi.org/10.1553/etna_vol54s534openalex-snapshot
Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01812openalex-snapshot
On conformal maps from multiply connected domains onto lemniscatic domains
inferred← citeshttps://doi.org/10.48550/arxiv.1505.08072openalex-snapshot
Convergence analysis of GMRES for the Helmholtz equation via pseudospectrum
inferred← citeshttps://doi.org/10.53846/goediss-3724openalex-snapshot
CUDA-based Scientific Computing
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.