Related papers: Optimal Solvers for Linear Systems with Fractional…
We consider an identification problem, where the state $u$ is governed by a fractional elliptic equation and the unknown variable corresponds to the order $s \in (0,1)$ of the underlying operator. We study the existence of an optimal pair…
We study the optimal approximation of the solution of an operator equation Au=f by linear and nonlinear mappings. We identify those cases where optimal nonlinear approximation is better than optimal linear approximation.
This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family…
This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical…
Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability; but, need to be used with an appropriate preconditioner (e.g.,…
The paper aims at constructing two different solutions to an elliptic system $$ u \cdot \nabla u + (-\Delta)^m u = \lambda F $$ defined on the two dimensional torus. It can be viewed as an elliptic regularization of the stationary Burgers…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \in [0,1]^{m \times n}$, a vector $b \in [1,\infty)^m$, and a monotone…
We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…
We consider the problem of efficiently solving large-scale linear least squares problems that have one or more linear constraints that must be satisfied exactly. Whilst some classical approaches are theoretically well founded, they can face…
We consider the solution of systems of linear algebraic equations (SLAEs) with an ill-conditioned or degenerate exact matrix and an approximate right-hand side. An approach to solving such a problem is proposed and justified, which makes it…
In this paper we consider one particular mathematical problem of this large area of fractional powers of self-adjoined elliptic operators, defined either by Dunford-Taylor-like integrals or by the representation through the spectrum of the…
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…
We examine the elliptic system given by \begin{eqnarray*} \qquad \left\{ \begin{array}{lcl} -\Delta u =\lambda f(v) \quad \mbox{ in } \Omega -\Delta v =\gamma f(u) \quad \mbox{ in } \Omega, u=v =0, \quad \mbox{ on } \pOm \end{array}\right.…
We provide a novel approach to the numerical solution of the family of nonlocal elliptic equations $(-\Delta)^su=f$ in $\Omega$, subject to some homogeneous boundary conditions $\mathcal{B}(u)=0$ on $\partial \Omega$, where $s\in(0,1)$,…
In this article, we prove existence results of positive solutions for the following nonlinear elliptic problem with gradient terms: \begin{eqnarray*} \left\{\begin{array}{l@{\quad }l} (-\Delta)^\alpha u=f(x,u,v,\nabla u, \nabla v) &{\rm…
In this work we analyze the existence of solutions to the nonlinear elliptic system: \begin{equation*} \left\{ \begin{array}{rcll} -\Delta u & = & v^q+\a g & \text{in }\Omega , \\ -\Delta v& = &|\nabla u|^{p}+\l f &\text{in }\Omega , \\…
We present and study a novel numerical algorithm to approximate the action of $T^\beta:=L^{-\beta}$ where $L$ is a symmetric and positive definite unbounded operator on a Hilbert space $H_0$. The numerical method is based on a…
We consider the following equations: \begin{equation*} \left\{\begin{array}{ll} (-\triangle)^{\alpha/2}u(x)=f(v(x)), \\ (-\triangle)^{\beta/2}v(x)=g(u(x)), &x \in R^{n},\\ u,v\geq 0, &x \in R^{n}, \end{array} \right. \end{equation*} for…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…