Related papers: The two-grid algorithm confronts a shifted unitary…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
The Krylov subspace projection approach is a well-established tool for the reduced order modeling of dynamical systems in the time domain. In this paper, we address the main issues obstructing the application of this powerful approach to…
We propose two methods to find a proper shift parameter in the shift-and-invert method for computing matrix exponential matrix-vector products. These methods are useful in the case of matrix exponential action has to be computed for a…
Quantum Krylov algorithms have emerged as a promising approach for ground-state energy estimation in the near-term quantum computing era. A major challenge, however, lies in their inherently substantial sampling cost, primarily due to the…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
Convex separable quadratic optimization problems occur in many practical applications. In this paper, based on an iterative resolution scheme of the KKT system, we develop an efficient method for solving a quadratic programming problem with…
The unit commitment problem (UC) is an optimization problem concerning the operation of electrical generators. Many algorithms have been proposed for the UC and in recent years a more decentralized approach, by solving the UC with…
During the past decade, Model Order Reduction (MOR) has become key enabler for the efficient simulation of large circuit models. MOR techniques based on moment-matching are well established due to their simplicity and computational…
We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov's smoothing technique via general Bregman distance functions. It…
This paper tackles the challenging problem of gridless two-dimensional (2D) direction-of-arrival (DOA) estimation for a uniform circular array (UCA) from a single snapshot of data. Conventional gridless methods often fail in this scenario…
There are variety of computational algorithms need sequential sweeping; sweeping based on specific order; on a structured grid, e.g., preconditioning (smoothing) by SOR or ILU methods and solution of eikonal equation by fast sweeping…
Using the shift-operator technique, a compact formula for the Fourier transform of a product of two Slater-type orbitals located on different atomic centers is derived. The result is valid for arbitrary quantum numbers and was found to be…
For embedded boundary electromagnetics using the Dey-Mittra algorithm, a special grad-div matrix constructed in this work allows use of multigrid methods for efficient inversion of Maxwell's curl-curl matrix. Efficient curl-curl inversions…
Application of multigrid solvers in shifted linear systems is studied. We focus on accelerating the rational approximation needed for simulating single flavor operators. This is particularly useful, in the case of twisted mass fermions for…
We present a novel unified analysis for a broad class of adaptive optimization algorithms with structured (e.g., layerwise, diagonal, and kronecker-factored) preconditioners for both online regret minimization and offline convex…
The use of block Krylov subspace methods for computing the solution to a sequence of shifted linear systems using subspace recycling was first proposed in [Soodhalter, SISC 2016], where a recycled shifted block GMRES algorithm (rsbGMRES)…
In this text I present a couple of new principles and thereon based iterative methods for numerical solution of sequences of systems of linear equations with fixed system matrix and changing right-hand-sides. The use of the new methods is…
We develop two new tools for use in Alexandrov geometry: a theory of ramified orientable double covers and a particularly useful version of the Slice Theorem for actions of compact Lie groups. These tools are applied to the classification…
Developing efficient solvers for large-scale multi-term linear matrix equations remains a central challenge in numerical linear algebra and is still largely unresolved. This paper introduces a methodology leveraging CUR decomposition for…
We present a novel area matching algorithm for merging two different 2D grid maps. There are many approaches to address this problem, nevertheless, most previous work is built on some assumptions, such as rigid transformation, or similar…