Related papers: Efficient and Accurate Linear Algebraic Methods fo…
We propose a semi-proximal augmented Lagrangian based decomposition method for convex composite quadratic conic programming problems with primal block angular structures. Using our algorithmic framework, we are able to naturally derive…
Self-consistent approaches to superfluid many-fermion systems in 3-dimensions (and subsequent time-dependent approaches) require a large number of diagonalizations of very large dimension hermitian matrices, which results in enormous…
In the present paper, we present some numerical methods for computing approximate solutions to some large differential linear matrix equations. In the first part of this work, we deal with differential generalized Sylvester matrix equations…
This paper presents an Euler--Lagrange system for a continuous-time model of the accelerated gradient methods in smooth convex optimization and proposes an associated Lyapunov-function-based convergence analysis framework. Recently,…
This work proposes and analyzes a fully discrete numerical scheme for solving the Landau-Lifshitz-Gilbert (LLG) equation, which achieves fourth-order spatial accuracy and third-order temporal accuracy.Spatially, fourth-order accuracy is…
In the present study, we establish two new block variants of the Conjugate Orthogonal Conjugate Gradient (COCG) and the Conjugate A-Orthogonal Conjugate Residual (COCR) Krylov subspace methods for solving complex symmetric linear systems…
This paper discusses the theory and numerical method of two-scale analysis for the multiscale Landau-Lifshitz-Gilbert equation in composite ferromagnetic materials. The novelty of this work can be summarized in three aspects: Firstly, the…
The overlap Dirac operator in lattice QCD requires the computation of the sign function of a matrix. While this matrix is usually Hermitian, it becomes non-Hermitian in the presence of a quark chemical potential. We show how the action of…
A generalized skew-symmetric Lanczos bidiagonalization (GSSLBD) method is proposed to compute several extreme eigenpairs of a large matrix pair $(A,B)$, where $A$ is skew-symmetric and $B$ is symmetric positive definite. The underlying…
In this paper, we present a new approach for model reduction of large scale first and second order dynamical systems with multiple inputs and multiple outputs (MIMO). This approach is based on the projection of the initial problem onto…
We propose a variational splitting technique for the generalized-$\alpha$ method to solve hyperbolic partial differential equations. We use tensor-product meshes to develop the splitting method, which has a computational cost that grows…
We have introduced the generalized alternating direction implicit iteration (GADI) method for solving large sparse complex symmetric linear systems and proved its convergence properties. Additionally, some numerical results have…
We describe a number of recently developed techniques for improving the performance of large-scale nuclear configuration interaction calculations on high performance parallel computers. We show the benefit of using a preconditioned block…
A comprehensive and detailed account is presented for the finite-temperature many-body perturbation theory for electrons that expands in power series all thermodynamic functions on an equal footing. Algebraic recursions in the style of the…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
The Lanczos algorithm, introduced by Cornelius Lanczos, has been known for a long time and is widely used in computational physics. While often employed to approximate extreme eigenvalues and eigenvectores of an operator, recently interest…
We provide convergence rates for Krylov subspace solutions to the trust-region and cubic-regularized (nonconvex) quadratic problems. Such solutions may be efficiently computed by the Lanczos method and have long been used in practice. We…
GMRES is one of the most popular iterative methods for the solution of large linear systems of equations that arise from the discretization of linear well-posed problems, such as Dirichlet boundary value problems for elliptic partial…
This contribution is dedicated to the exploration of exponential operator splitting methods for the time integration of evolution equations. It entails the review of previous achievements as well as the depiction of novel results. The…
Recently, there has been significant progress in the development of distributed first order methods. (At least) two different types of methods, designed from very different perspectives, have been proposed that achieve both exact and linear…