Related papers: On solving symmetric systems of linear equations i…
We discuss how the experimental neutrino oscillation data can be realized in the framework of the baryon triality ($B_3$) constrained supersymmetric Standard Model (cSSM). We show how to obtain phenomenologically viable solutions, which are…
In this paper, we consider the iterative solution of linear algebraic equations under the condition that matrix-vector products with the coefficient matrix are computed only partially. At the same time, non-computed entries are set to…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
The computation of approximating e^tA B, where A is a large sparse matrix and B is a rectangular matrix, serves as a crucial element in numerous scientific and engineering calculations. A powerful way to consider this problem is to use…
In this paper we present deflation and augmentation techniques that have been designed to accelerate the convergence of Krylov subspace methods for the solution of linear systems of equations. We review numerical approaches both for linear…
Subspace recycling iterative methods and other subspace augmentation schemes are a successful extension to Krylov subspace methods in which a Krylov subspace is augmented with a fixed subspace spanned by vectors deemed to be helpful in…
We perform a classification of third order integrable systems of evolution equations with respect to higher symmetries. Applying it, we consider polynomial systems that are 0-homogeneous under a suitable weighting of variables with main…
For optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL) methods sequentially minimize a Lagrangian function subject to linearized constraints. These methods converge rapidly near a solution but may not be…
In this paper, by using the Brunovsky normal form, we provide a reformulation of the problem consisting in finding the actuator design which minimizes the controllability cost for finite-dimensional linear systems with scalar controls. Such…
In this paper we show that any static and spherically symmetric anisotropic solution of the Einstein field equations can be thought as a system sourced by certain deformed isotropic system in the context of Minimal Geometric…
We propose a novel algorithm based on inexact GMRES methods for linear response calculations in density functional theory. Such calculations require iteratively solving a nested linear problem $\mathcal{E} \delta\rho = b$ to obtain the…
The Marchenko method is developed in the inverse scattering problem for a linear system of first-order differential equations containing potentials proportional to the spectral parameter. The corresponding Marchenko system of integral…
This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…
For the Hermitian inexact Rayleigh quotient iteration (RQI), the author has established new local general convergence results, independent of iterative solvers for inner linear systems. The theory shows that the method locally converges…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…
Krylov subspace methods quantify operator growth in quantum many-body systems through Lanczos coefficients that encode how operators spread under time evolution. Although these diagnostics were originally motivated by questions of chaos and…
A linear inverse problem is proposed that requires the determination of multiple unknown signal vectors. Each unknown vector passes through a different system matrix and the results are added to yield a single observation vector. Given the…
Consider continuous-time linear switched systems on R^n associated with compact convex sets of matrices. When the system is irreducible and the largest Lyapunov exponent is equal to zero, there always exists a Barabanov norm (i.e. a norm…
We show that a common Lyapunov matrix exists for the convex combination of two Hurwitz matrices if and only if the intersection of the set of strict Lyapunov matrices for one matrix and the set of non-strict Lyapunov matrices for the other…
In this work, we propose a robust and easily implemented algebraic multigrid method as a stand-alone solver or a preconditioner in Krylov subspace methods for solving either symmetric and positive definite or saddle point linear systems of…