Polynomial approximation of functions of matrices and applications
From MaRDI portal
Publication:1825596
DOI10.1007/BF01061265zbMATH Open0684.65040MaRDI QIDQ1825596FDOQ1825596
Publication date: 1989
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Recommendations
- Efficient mixed rational and polynomial approximation of matrix functions
- Approximation of the numerical range of polynomial operator matrices
- Approximate zero polynomials of polynomial matrices and linear systems
- Approximation of Matrix-Valued Functions
- Polynomial approximation of vector functions
- scientific article; zbMATH DE number 1303667
- Factorization and approximation problems for matrix functions
- scientific article; zbMATH DE number 2087114
- Matrix polynomial and epsilon-type extrapolation methods with applications
- Polynomial interpolation and Gaussian quadrature for matrix-valued functions
Multidimensional problems (41A63) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Algorithms for approximation of functions (65D15)
Cites Work
- Title not available (Why is that?)
- Spectral Methods in Time for Parabolic Problems
- Spectral Methods in Time for Hyperbolic Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- NOTE ON DEGREE OF APPROXIMATION TO ANALYTIC FUNCTIONS BY RATIONAL FUNCTIONS WITH PREASSIGNED POLES
- Numerical Computation of the Schwarz–Christoffel Transformation
- The Tchebychev iteration for nonsymmetric linear systems
- On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type method
- On the Construction of Semi-Iterative Methods
- Richardson's iteration for nonsymmetric matrices
- The analysis of k-step iterative methods for linear systems from summability theory
- Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems
- Title not available (Why is that?)
Cited In (20)
- The application of Leja points to Richardson iteration and polynomial preconditioning
- An interpolatory approximation of the matrix exponential based on Faber polynomials
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Implementation of an adaptive algorithm for Richardson's method
- Polynomial-quadrature method of approximate solution of Riemann problem with functional-commutative matrix
- Evaluating non-analytic functions of matrices
- Localization in Matrix Computations: Theory and Applications
- Title not available (Why is that?)
- Polynomial interpolation and Gaussian quadrature for matrix-valued functions
- Title not available (Why is that?)
- Polynomial time-marching for nonperiodic boundary value problems
- On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
- Application of Hankel matrices in polynomial regression
- Title not available (Why is that?)
- Matrix polynomial and epsilon-type extrapolation methods with applications
- Semi-global approach for propagation of the time-dependent Schrödinger equation for time-dependent and nonlinear problems
- Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
- Very accurate time propagation of coupled Schrödinger equations for femto- and attosecond physics and chemistry, with C++ source code
- Estimation of spectral bounds in gradient algorithms
Uses Software
This page was built for publication: Polynomial approximation of functions of matrices and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825596)
