Related papers: Backward Stability of Explicit External Deflation …
In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g. the Helmholtz…
The paper is concerned with a posteriori error bounds for a wide class of numerical schemes, for $n\times n$ hyperbolic conservation laws in one space dimension. These estimates are achieved by a "post-processing algorithm", checking that…
A 3D coefficient inverse problem for a hyperbolic equation with non-overdetermined data is considered. The forward problem is the Cauchy problems with the initial condition the delta function concentrated at a single plane (i.e. the plane…
Maxwell's equations are considered with transparent boundary conditions, for initial conditions and inhomogeneity having support in a bounded, not necessarily convex three-dimensional domain or in a collection of such domains. The numerical…
New convergence bounds are presented for weighted, preconditioned, and deflated GMRES for the solution of large, sparse, non-Hermitian linear systems. These bounds are given for the case when the Hermitian part of the coefficient matrix is…
We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a closed, convex subset of the domain of the operator,…
It has been the standard teaching of today that backward stability analysis is taught as absolute, just as in Newtonian physics time is taught absolute time. We will prove it is not true in general. It depends on algorithms. We will prove…
We consider the demixing problem of two (or more) high-dimensional vectors from nonlinear observations when the number of such observations is far less than the ambient dimension of the underlying vectors. Specifically, we demonstrate an…
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
The power method is a basic method for computing the dominant eigenpair of a matrix. In this paper, we propose a structure-preserving power-like method for computing the dominant conjugate pair of purely imaginary eigenvalues and the…
In this work, the multiplier method is extended to obtain a general lower bound of the exponential decay rate in terms of the physical parameters for port-Hamiltonian systems in one space dimension with boundary dissipation. The physical…
In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…
We provide new complexity information for the convergence of the Hybrid Steepest Descent Method for solving the Variational Inequality Problem for a strict contraction on Hilbert space over a closed convex set C given either as the fixed…
In this article we present three robust instability mechanisms for linear and nonlinear inverse problems. All of these are based on strong compression properties (in the sense of singular value or entropy number bounds) which we deduce…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…
This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved…
In this paper, a rigorous computational method to enclose eigendecompositions of complex interval matrices is proposed. Each eigenpair $x=(\lambda,v)$ is found by solving a nonlinear equation of the form $f(x)=0$ via a contraction argument.…