Results 51 to 60 of about 155 (114)
Electronic Structure Calculations in Plane-Wave Codes without Diagonalization
, 2007 . We present an algorithm to reduce the computational complexity for plane-wave codes used in electronic structure calculations. Our proposed algorithm avoids the diagonalization of large Hermitian matrices arising in such problems.
Hanchul Kim +3 more
core
A new method for computing the stable invariant subspace of a real Hamiltonian matrix or: Breaking Van Loan's curse? [PDF]
, 1997 A new backward stable, structure preserving method of complexity O(n 3 ) is presented for computing the stable invariant subspace of a real Hamiltonian matrix and the stabilizing solution of the continuous-time algebraic Riccati equation.
Benner, P. +5 more
core
Preconditioners for ill-conditioned Toeplitz matrices
, 1999 . This paper is concerned with the solution of systems of linear equations ANx = b, where fAN g N2N denotes a sequence of positive definite Hermitian ill--conditioned Toeplitz matrices arising from a (real--valued) nonnegative generating function f 2 ...
Steidl, Gabriele +3 more
core +1 more source
Bisection Acceleration for the Symmetric Tridiagonal Eigenvalue Problem
, 1999 We present new algorithms that accelerate the bisection method for the symmetric tridiagonal eigenvalue problem. The algorithms rely on some new techniques, including a new variant of Newton's iteration that reaches cubic convergence (right from the
Victor Y. Pan, Elliot Linzer
core
On a Variational Formulation of QSVD and RSVD
, 1998 Recently, Chu, Funderlic and Golub [ SIAM J. Matrix Anal. Appl., 18:1082--1092, 1997] presented a variational formulation for the quotient singular value decomposition (QSVD) of two matrices A 2 R n\Thetam ; C 2 R p\Thetam which is a generalization ...
Bart De Moor, Delin Chu
core
Extreme Eigenvalues Of Real Symmetric Toeplitz Matrices
, 2000 We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations.
A. Melman, A Melman
core
Using The Matrix Sign Function To Compute Invariant Subspaces
, 1998 . The matrix sign function has several applications in system theory and matrix computations. However, the numericalbehavior of the matrix sign function, and its associated divideand -conquer algorithm for computing invariant subspaces, are still not ...
James Demmel, Zhaojun Bai
core
Numerical Solution of Generalized Lyapunov Equations
, 1996 Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The first one is a generalization of the Bartels--Stewart method and the second is an extension of Hammarling's method to ...
Thilo Penzl
core
A Support Based Algorithm for Optimization with Eigenvalue Constraints
, 2013 Optimization of convex functions subject to eigenvalue constraints is intriguing because of peculiar analytical properties of eigenvalues, and is of practical interest because of wide range of applications in fields such as structural design and control ...
Emre Mengi
core
Splitting of Expanded Tridiagonal Matrices
, 2007 The article addresses a regular splitting of tridiagonal matrices. The given tridiagonal matrix A is first expanded to an equivalent matrix e A and then split as e A = B \Gamma R for which B is block-diagonal and every eigenvalue of B \Gamma1 R is ...
Gamma For Which, Seongjai Kim
core