Estimates for Some Computational Techniques in Linear Algebra
From MaRDI portal
Publication:5535882
DOI10.2307/2003590zbMATH Open0156.16202OpenAlexW4241032568MaRDI QIDQ5535882FDOQ5535882
Authors: Shmuel Kaniel
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2003590
Cites Work
- Methods of conjugate gradients for solving linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Über diskrete und lineare Tschebyscheff-Approximationen
- Title not available (Why is that?)
- Moments and characteristic roots
- Über eine Verallgemeinerung einer Ungleichung von L.V. Kantorowitsch
- R. A. Fisher and evolutionary theory
- On the approximation of symmetric operators by operators of finite rank
Cited In (65)
- An Application of Approximation Theory to an Error Estimate in Linear Algebra
- Numerical solution of linear eigenvalue problems
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output
- Polynomial preconditioners for regularized linear inverse problems
- \textit{TimeEvolver}: a program for time evolution with improved error bound
- Improved estimation of relaxation time in nonreversible Markov chains
- A generalized nonsymmetric Lanczos procedure
- On the condition number of the critically-scaled Laguerre unitary ensemble
- A modified SSOR-like preconditioner for non-Hermitian positive definite matrices
- On the use of harmonic Ritz pairs in approximating internal eigenpairs
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- On the numerical solution of the eigenvalue problem of the Laplace operator by a capacitance matrix method
- The nonsymmetric Lanczos algorithm and controllability
- Computing interior eigenvalues of large matrices
- An adaptive multipreconditioned conjugate gradient algorithm
- Sharp Ritz value estimates for restarted Krylov subspace iterations
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Convergence analysis of restarted Krylov subspace eigensolvers
- Rational Krylov sequence methods for eigenvalue computation
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Comparison of splittings used with the conjugate gradient algorithm
- Iterative solution of linear systems in the 20th century
- On preconditioned eigensolvers and invert-Lanczos processes
- An explicit formula for Lanczos polynomials
- Eigenvalue computation in the 20th century
- The convergence of the method of conjugate gradients at isolated extreme points of the spectrum
- The rate of convergence of conjugate gradients
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Least-square acceleration of iterative methods for linear equations
- Sharpness in rates of convergence for the symmetric Lanczos method
- The Lanczos Algorithm with Selective Orthogonalization
- How to Make the Lanczos Algorithm Converge Slowly
- The block conjugate gradient algorithm and related methods
- Further results on the convergence behavior of conjugate-gradients and Ritz values
- Uniform Error Estimates for the Lanczos Method
- On the rate of convergence of the preconditioned conjugate gradient method
- Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods
- Optimal a priori error bounds for the Rayleigh-Ritz method
- Implementing Lanczos-like algorithms on hypercube architectures
- Vandermonde matrices with Chebyshev nodes
- Optimal low-rank approximations of Bayesian linear inverse problems
- Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- A Neumann-Neumann preconditioned iterative substructuring approach for computing solutions to Poisson's equation with prescribed jumps on an embedded boundary
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Towards a black box Lanczos program
- Analytical bounds for block approximate factorization methods
- Variational and numerical methods for symmetric matrix pencils
- Convergence of the block Lanczos method for eigenvalue clusters
- Bounding the spectrum of large Hermitian matrices
- On Meinardus' examples for the conjugate gradient method
- Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices
- Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils
- Convergence of CG and GMRES on a tridiagonal Toeplitz linear system
- Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers
- Some basic information on information-based complexity theory
- Practical use of the symmetric Lanczos process with re-orthogonalization
- Krylov space methods on state-space control models
- Numerical determination of partial spectrum of Hermitian matrices using a Lánczos method with selective reorthogonalization
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- A discrete Newton algorithm for minimizing a function of many variables
- Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method
- The convergence behavior of Ritz values in the presence of close eigenvalues
This page was built for publication: Estimates for Some Computational Techniques in Linear Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5535882)