Related papers: On the correction equation of the Jacobi-Davidson …
The eigenvalue decomposition (EVD) of (a batch of) Hermitian matrices of order two has a role in many numerical algorithms, of which the one-sided Jacobi method for the singular value decomposition (SVD) is the prime example. In this paper…
We develop an iterative refinement method that improves the accuracy of a user-chosen subset of $k$ eigenvectors ($k\ll n$) of an $n\times n$ real symmetric matrix. Using an orthogonal matrix represented in compact WY form, the method…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and…
We describe a three precision variant of Newton's method for nonlinear equations. We evaluate the nonlinear residual in double precision, store the Jacobian matrix in single precision, and solve the equation for the Newton step with…
Cubic invariants for two-dimensional Hamiltonian systems are investigated using the Jacobi geometrization procedure. This approach allows for a unified treatment of invariants at both fixed and arbitrary energy. In the geometric picture the…
We consider multi-agent, convex optimization programs subject to separable constraints, where the constraint function of each agent involves only its local decision vector, while the decision vectors of all agents are coupled via a common…
In this paper, we first establish the convergence criteria of the residual iteration method for solving quadratic eigenvalue problem- s. We analyze the impact of shift point and the subspace expansion on the convergence of this method. In…
This paper introduces a sparse matrix discrete interpolation method to effectively compute matrix approximations in the reduced order modeling framework. The sparse algorithm developed herein relies on the discrete empirical interpolation…
In this pedagogical article, we present a simple direct matrix method for analytically computing the Jacobian of nonlinear algebraic equations that arise from the discretization of nonlinear integro-differential equations. The method is…
In this paper, we provide a simple way to find uniqueness sets for additive eigenvalue problems of first and second order Hamilton--Jacobi equations by using a PDE approach. An application in finding the limiting profiles for large time…
The approximate solution of large-scale algebraic Riccati equations is considered. We are interested in approximate solutions which yield a Riccati residual matrix of a particular small rank. It is assumed that such approximate solutions…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
It is needed to solve generalized eigenvalue problems (GEP) in many applications, such as the numerical simulation of vibration analysis, quantum mechanics, electronic structure, etc. The subspace iteration is a kind of widely used…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
In this paper the Jacobi formula is used to recursively generate (diagonal) univariate Pade approximants using the Tau method for solutions Michaelis-Menten equation with first order input. In the algorithm the Jacobi coefficients and error…
For an arbitrary Hermitian period-$T$ Jacobi operator, we assume a perturbation by a Wigner-von Neumann type potential to devise subordinate solutions to the formal spectral equation for a (possibly infinite) real set, $S$, of the spectral…
Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is…
An efficient Jacobi-Galerkin spectral method for calculating eigenvalues of Riesz fractional partial differential equations with homogeneous Dirichlet boundary values is proposed in this paper. In order to retain the symmetry and positive…
Motivated by optimal control problems and differential games for functional differential equations of retarded type, the paper deals with a Cauchy problem for a path-dependent Hamilton--Jacobi equation with a right-end boundary condition.…