Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
From MaRDI portal
Recommendations
- Convergence analysis of Krylov subspace methods
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- Geometric aspects of the theory of Krylov subspace methods
- Krylov Subspace Solvers and Preconditioners
- Krylov subspace processes, Krylov subspace methods, and iteration polynomials
Cited in
(55)- An implicit filter for rational Krylov using core transformations
- Robust and optimal multi-iterative techniques for Iga collocation linear systems
- Isogeometric discretizations with generalized B-splines: symbol-based spectral analysis
- The Fourier extension method and discrete orthogonal polynomials on an arc of the circle
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- An extended Hessenberg form for Hamiltonian matrices
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- Extremal polynomials on the \(n\)-grid
- On the convergence of Krylov linear equation solvers
- Spectral analysis and spectral symbol of matrices in isogeometric collocation methods
- Polynomials and lemniscates of indefiniteness
- Convergence analysis of an extended Krylov subspace method for the approximation of operator functions in exponential integrators
- Sharpness in rates of convergence for the symmetric Lanczos method
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- Convergence analysis of Krylov subspace methods
- Convergence of the block Lanczos method for eigenvalue clusters
- Spectral analysis of matrices in Galerkin methods based on generalized B-splines with high smoothness
- The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deterministic
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Superlinear convergence of Krylov subspace methods for self-adjoint problems in Hilbert space
- Development and analysis of a block-preconditioner for the phase-field crystal equation
- Convergence of the Isometric Arnoldi Process
- Universality in the two‐matrix model: a Riemann‐Hilbert steepest‐descent analysis
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
- Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners
- A numerical solution of the constrained weighted energy problem
- Extremal rational functions on symmetric discrete sets and superlinear convergence of the ADI method
- Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices
- Prior-Preconditioned Conjugate Gradient Method for Accelerated Gibbs Sampling in “Large n , Large p ” Bayesian Sparse Regression
- Asymptotics of Chebyshev polynomials. V: Residual polynomials
- Distribution results for a special class of matrix sequences: joining approximation theory and asymptotic linear algebra
- On generating Sobolev orthogonal polynomials
- Approximating classes of sequences: The Hermitian case
- Estimates for the asymptotic convergence factor of two intervals
- A unification of unitary similarity transforms to compressed representations
- GLT sequences and automatic computation of the symbol
- A lower bound for the norm of the minimal residual polynomial
- From asymptotic distribution and vague convergence to uniform convergence, with numerical applications
- The numerical linear algebra of weights. I: From the spectral analysis to conditioning and preconditioning in the one-dimensional Laplacian case
- Random multitype spanning forests for synchronization on sparse graphs
- Estimation of spectral gaps for sparse symmetric matrices
- Applications of AAA rational approximation
- Introduction to the theory of generalized locally Toeplitz sequences and its applications
- Bounds for weighted Chebyshev and residual polynomials on subsets of \(\mathbb{R}\)
- Spectral analysis of the stiffness matrix sequence in the approximated Stokes equation
- Unbounded Widom factors for orthogonal and residual polynomials
- A numerical solution of the constrained energy problem
- Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
- Stability of the notion of approximating class of sequences and applications
- Deflated block Krylov subspace methods for large scale eigenvalue problems
This page was built for publication: Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470832)
