Algorithms for confluent Vandermonde systems
From MaRDI portal
Publication:2558741
DOI10.1007/BF01436299zbMATH Open0255.65018OpenAlexW1998656952MaRDI QIDQ2558741FDOQ2558741
Authors: T. Elfving, Åke Björck 
Publication date: 1973
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132219
Cites Work
- Solution of Vandermonde systems of equations
- Solving confluent Vandermonde systems of Hermite type
- On the Construction of Discrete Approximations to Linear Differential Expressions
- Control and Estimation of Computational Errors in the Evaluation of Interpolation Formulae and Quadrature Rules
- Rapid computation of general interpolation formulas and mechanical quadrature rules
- An Algorithm for the Numerical Application of a Linear Operator
Cited In (18)
- LANCZOS, GAUSS AND THE PROBLEM OF MOMENTS
- On variable step Hermite-Birkhoff solvers combining multistep and 4-stage DIRK methods for stiff ODEs
- Explicit factorization of the Vandermonde matrix
- Symbiosis between linear algebra and optimization
- Three-stage Hermite-Birkhoff solver of order 8 and 9 with variable step size for stiff ODEs
- A method for computing all the zeros of a polynomial with real coefficients
- Optimally conditioned Vandermonde matrices
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Inversion of confluent Vandermonde matrices
- Lower bounds for the condition number of a real confluent Vandermonde matrix
- The block decomposition of a Vandermonde matrix and its applications
- Vandermonde matrices with nodes in the unit disk and the large sieve
- On variable step highly stable 4-stage Hermite-Birkhoff solvers for stiff ODEs
- A note on the Le Verrier-Fadeev's method
- A Review on Multiple Purely Imaginary Spectral Values of Time-Delay Systems
- Characterizing the codimension of zero singularities for time-delay systems. A link with Vandermonde and Birkhoff incidence matrices
- Newton interpolation is efficient for approximation of linear functionals
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
This page was built for publication: Algorithms for confluent Vandermonde systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558741)
