Related papers: Computing a partial Schur factorization of nonline…
In this work, we propose a new splitting algorithm for solving structured monotone inclusion problems composed of a maximally monotone operator, a maximally monotone and Lipschitz continuous operator and a cocoercive operator. Our method…
Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue…
Large-scale eigenvalue problems pose a significant challenge to classical computers. While there are efficient quantum algorithms for unitary or Hermitian matrices, eigenvalue problems for non-normal matrices remain open in quantum…
We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…
We implement the Numerical Unified Transform Method to solve the Nonlinear Schr\"odinger equation on the half-line. For so-called linearizable boundary conditions, the method solves the half-line problems with comparable complexity as the…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
In this work, we propose a parallel-in-time solver for linear and nonlinear ordinary differential equations. The approach is based on an efficient multilevel solver of the Schur complement related to a multilevel time partition. For linear…
Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…
In this paper, we are concerned with a shape design problem, in which our target is to design, up to rigid transformations and scaling, the shape of an object given either its polarization tensor at multiple contrasts or the partial…
The longstanding nonnegative inverse eigenvalue problem (NIEP) is to determine which multisets of complex numbers occur as the spectrum of an entry-wise nonnegative matrix. Although there are some well-known necessary conditions, a solution…
A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…
A new scaling and recovering algorithm is proposed for simultaneously computing the matrix $\varphi$-functions that arise in exponential integrator methods for the numerical solution of certain first-order systems of ordinary differential…
In this work, we present an algorithmic treatment of the representation theory of the algebra of partially transposed permutation operators, denoted by $\mathcal{A}^d_{p,p}$, which is a matrix representation of the abstract walled Brauer…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
The combination of nonlinear FETI-DP (Dual Primal Finite Element Tearing and Interconnecting) and Quasi-Newton methods using a sequential quadratic programming (SQP) approach is considered. Nonlinear FETI-DP methods are parallel iterative…
In this work, a new algorithm for solving symmetric indefinite systems of linear equations is presented. It factorizes the matrix into the form LDLt using Jacobi rotations in order to increase the pivot's absolute value. Furthermore, Rook's…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
The main goal of this paper is to achieve a simultaneous treatment of the even and odd truncated matricial Hamburger moment problems in the most general case. In the odd case, these results are completely new for the matrix case, whereas…