Related papers: Substructuring the Hiptmair-Xu preconditioner for …
This paper suggests two novel ideas to develop new proximal variable-metric methods for solving a class of composite convex optimization problems. The first idea is a new parameterization of the optimality condition which allows us to…
We introduce a software package called HIFIR for preconditioning sparse, unsymmetric, ill-conditioned, and potentially singular systems. HIFIR computes a hybrid incomplete factorization, which combines multilevel incomplete LU factorization…
This paper concerns the reconstruction of a scalar diffusion coefficient $\sigma(x)$ from redundant functionals of the form $H_i(x)=\sigma^{2\alpha}(x)|\nabla u_i|^2(x)$ where $\alpha\in\Rm$ and $u_i$ is a solution of the elliptic problem…
Recent developemnts in string compactifications in the presence of antisymmetric field backgrounds suggest a new simple and predictive structure for soft terms in the MSSM depending only on two parameters. They give rise to a positive…
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…
In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…
For a partition $\nu$, let $\lambda,\mu\subseteq \nu$ be two distinct partitions such that $|\nu/\lambda|=|\nu/\mu|=1$. Butler conjectured that the divided difference…
In this paper we develop and analyse domain decomposition methods for linear systems of equations arising from conforming finite element discretisations of positive Maxwell-type equations. Convergence of domain decomposition methods rely…
In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
In this paper, we present a novel method to compute an explicit formula for the inverse of the confluent Vandermonde matrices. Our proposed results may have many interesting perspectives in diverse areas of mathematics and natural sciences,…
We consider the inverse problem of the simultaneous reconstruction of the dielectric permittivity and magnetic permeability functions of the Maxwell's system in 3D with limited boundary observations of the electric field. The theoretical…
We derive an extension of the sequential homotopy method that allows for the application of inexact solvers for the linear (double) saddle-point systems arising in the local semismooth Newton method for the homotopy subproblems. For the…
We develop a finite volume method for Maxwell's equations in materials whose electromagnetic properties vary in space and time. We investigate both conservative and non-conservative numerical formulations. High-order methods accurately…
Topology optimization problems generally support multiple local minima, and real-world applications are typically three-dimensional. In previous work [I. P. A. Papadopoulos, P. E. Farrell, and T. M. Surowiec, Computing multiple solutions of…
We provide a complete structure theorem for involutory matrices. This yields a new approach to principal angles between subspaces and provide a series of nice formulae for these angles.
This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation, that is based on a proposed modified version of the mortar method. The…
Two classical theorems in matrix theory, due to Schur and Horn, relate the eigenvalues of a self-adjoint matrix to the diagonal entries. These have recently been given a formulation in the setting of operator algebras as the Schur-Horn…
The recently discovered general formulas for perturbative correlators in basic matrix models can be interpreted as the Schur-preservation property of Gaussian measures. Then substitution of Schur by, say, Macdonald polynomials, defines a…
In this paper we propose a variant of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the proposed preconditioner, we use the simplest coarse solver…