Computational aspects of F. L. Bauer's simultaneous iteration method
From MaRDI portal
Publication:2535359
Cites work
Cited in
(44)- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- Geometrically nonlinear finite element behaviour using buckling mode superposition
- A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
- Computational methods of linear algebra
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization
- An accurate algorithm for computing the eigenvalues of a polygonal membrane
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- Simultaneous iteration for the matrix eigenvalue problem
- Linear systems with a large number of sparse constraints with applications to incompressible materials
- On the efficient and accurate solution of the skew-symmetric eigenvalue problem
- Buckling analysis with the ASKA program system
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- QR-factorization of partitioned matrices. Solution of large systems of linear equations with non-definite coefficient matrices
- The Gifi system of descriptive multivariate analysis.
- Eigenvalue computation in the 20th century
- The trace minimization method for the symmetric generalized eigenvalue problem
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Time coupled diffusion maps
- Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- An analysis of convergence for a learning version of the subspace method
- Hypermatrix generalization of the Jacobi- and Eberlein-method for computing eigenvalues and eigenvectors of Hermitian or non-Hermitian matrices
- Arnoldi-Riccati method for large eigenvalue problems
- The fast recursive row-Householder subspace tracking algorithm
- Orthogonal iterations on companion-like pencils
- Kriging-enhanced ensemble variational data assimilation for scalar-source identification in turbulent environments
- Simultaneous iteration method for symmetric matrices
- Presentation geométrique des méthodes de calcul des valeurs propres
- On the computation of natural modes of an unsupported vibrating structure by simultaneous iteration
- Homogeneity analysis with k sets of variables: An alternating least squares method with optimal scaling features
- On the intermediate eigenvalues of symmetric sparse matrices
- A symmetric Craig‐Bampton method of coupled fluid‐structure systems
- On the convergence of higher-order orthogonal iteration
- Cluster robust estimates for block gradient-type eigensolvers
- Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers
- Gradient-type subspace iteration methods for the symmetric eigenvalue problem
- Subspace methods for nonlinear optimization
- Generalized approaches to the Maxbet problem and the Maxdiff problem, with applications to canonical correlations
This page was built for publication: Computational aspects of F. L. Bauer's simultaneous iteration method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535359)
