Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

The ADI iteration is closely related to the rational Krylov projection methods for constructing low rank approximations to the solution of Sylvester equation. In this paper we show that the ADI and rational Krylov approximations are in fact equivalent when a special choice of shifts are employed in both methods. We will call these shifts pseudo H2-optimal shifts. These shifts are also optimal i...

Krylov subspace techniques in harmonic balance simulations become increasingly ineffective when applied to strongly nonlinear circuits. This limitation is particularly important in the simulation if the circu it has components being operated in a very nonlinear region. Ev en if the circuit contains only a few very nonlinear components, Krylov methods using standard preconditioners can become in...

We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form y = −Ay + g(t) and y = −Ay + g(t), where y(t) is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of the source term g(t), constructed with the help of the truncated SVD (singular value decompos...

Minimum mode following algorithms are widely used for saddle point searching in chemical and material systems. Common to these algorithms is a component to find the minimum curvature mode of the second derivative, or Hessian matrix. Several methods, including Lanczos, dimer, Rayleigh-Ritz minimization, shifted power iteration, and locally optimal block preconditioned conjugate gradient, have be...

On modern large-scale parallel computers, the performance of Krylov subspace iterative methods is limited by global synchronization. This has inspired the development of s-step (or communication-avoiding) Krylov subspace method variants, in which iterations are computed in blocks of s. This reformulation can reduce the number of global synchronizations per iteration by a factor of O(s), and has...

We consider a two-directional Krylov subspace Kk(A[j], b[j]), where besides the dimensionality k of the subspace increases, the matrix A[j] and vector b[j] which induce the subspace may also augment. Specifically, we consider the case where the matrix A[j] and the vector b[j] are augmented by block triangular bordering. We present a two-directional Arnoldi process to efficiently generate a sequ...