The Lanczos algorithm and complex Gauss quadrature
From MaRDI portal
Publication:1990909
Recommendations
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
- Computing rational Gauss-Chebyshev quadrature formulas with complex poles: The algorithm
- Lanczos algorithm for the quadratic eigenvalue problem in engineering applications
- The matrix and polynomial approaches to Lanczos-type algorithms
- Computation of Gauss-type quadrature formulas
- scientific article; zbMATH DE number 3994883
- Noniterative computation of Gauss-Jacobi quadrature
- Computation of rational Szegő-Lobatto quadrature formulas
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
Cites work
- scientific article; zbMATH DE number 3978276 (Why is no real title available?)
- scientific article; zbMATH DE number 3661196 (Why is no real title available?)
- scientific article; zbMATH DE number 3753925 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3313105 (Why is no real title available?)
- scientific article; zbMATH DE number 3037624 (Why is no real title available?)
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A breakdown-free Lanczos type algorithm for solving linear systems
- A generalized nonsymmetric Lanczos procedure
- A look-ahead algorithm for the solution of general Hankel systems
- A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An explicit formula for Lanczos polynomials
- Beiträge zur Kenntnis des Biorthogonalisierungs-Algorithmus von Lanczos
- Block Gauss and anti-Gauss quadrature with application to networks
- Complex Jacobi matrices and quadrature rules
- Continued fractions with applications
- Estimation of uTƒ(A)v for large‐scale unsymmetric matrices
- Functions of Matrices
- Gauss quadrature for quasi-definite linear functionals
- Krylov subspace methods. Principles and analysis.
- Linear algebra, rational approximation and orthogonal polynomials
- Matrices related to interpolatory quadratures
- Matrices, moments and quadrature with applications
- Matrix interpretation of formal orthogonal polynomials for non-definite functionals
- Matrix interpretations and applications of the continued fraction algorithm
- Model reduction using the Vorobyev moment problem
- On certain methods for expanding the characteristic polynomial
- On the ``Favard theorem and its extensions
- On the partial realization problem
- Padé-type approximation and general orthogonal polynomials
- Polynômes orthogonaux formels - applications
- Preconditioning and the conjugate gradient method in the context of solving PDEs
- Reduction to Tridiagonal Form and Minimal Realizations
- The Lanczos process and Padé approximation
- The diagonal of the Padé table and the approximation of the Weyl function of second-order difference operators
Cited in
(17)- Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix
- Matrix functions in network analysis
- Optimal averaged Padé-type approximants
- Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Orthogonal expansion of network functions
- Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules
- Shifted extended global Lanczos processes for trace estimation with application to network analysis
- Generalized block anti-Gauss quadrature rules
- On generating Sobolev orthogonal polynomials
- Decompositions of optimal averaged Gauss quadrature rules
- C^1 Lohner algorithm.
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
- Enhanced averaged quadrature rules with application to error estimation
- Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be?
- Error estimates for quadrature rules based on the Arnoldi process
- A Lanczos-like method for non-autonomous linear ordinary differential equations
This page was built for publication: The Lanczos algorithm and complex Gauss quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990909)
