Related papers: Optimal Solvers for Linear Systems with Fractional…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of…
Solving sparse linear systems from discretized PDEs is challenging. Direct solvers have in many cases quadratic complexity (depending on geometry), while iterative solvers require problem dependent preconditioners to be robust and…
We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical…
We describe an efficient method for the approximation of functions using radial basis functions (RBFs), and extend this to a solver for boundary value problems on irregular domains. The method is based on RBFs with centers on a regular grid…
This survey describes a class of methods known as "fast direct solvers". These algorithms address the problem of solving a system of linear equations $\boldsymbol{Ax}=\boldsymbol{b}$ arising from the discretization of either an elliptic PDE…
We investigate how to solve smooth matrix optimization problems with general linear inequality constraints on the eigenvalues of a symmetric matrix. We present solution methods to obtain exact global minima for linear objective functions,…
We are concerned with the almost automorphic solutions to the second-order elliptic differential equations of type $\ddot u(s) + 2 B \dot u(s) + A u(s) = f(s) (\ast),$ where $A, B$ are densely defined closed linear operators acting in a…
This paper deals with existence of solutions to the following fractional $p$-Laplacian system of equations \begin{equation*} %\tag{$\mathcal P$}\label{MAT1} \begin{cases} (-\Delta_p)^s u =|u|^{p^*_s-2}u+…
We present a novel algorithm attaining excessively fast, the sought solution of linear systems of equations. The algorithm is short in its basic formulation and, by definition, vectorized, while the memory allocation demands are trivial,…
We give a stochastic optimization algorithm that solves a dense $n\times n$ real-valued linear system $Ax=b$, returning $\tilde x$ such that $\|A\tilde x-b\|\leq \epsilon\|b\|$ in time: $$\tilde O((n^2+nk^{\omega-1})\log1/\epsilon),$$ where…
We study the existence of solutions for the following fractional Hamiltonian systems $$ \left\{ \begin{array}{ll} - _tD^{\alpha}_{\infty}(_{-\infty}D^{\alpha}_{t}u(t))-\lambda L(t)u(t)+\nabla W(t,u(t))=0,\\[0.1cm] u\in…
In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing…
We investigate stable solutions of elliptic equations of the type \begin{equation*} \left \{ \begin{aligned} (-\Delta)^s u&=\lambda f(u) \qquad {\mbox{ in $B_1 \subset \R^{n}$}} \\ u&= 0 \qquad{\mbox{ on $\partial B_1$,}}\end{aligned}\right…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves a fractional power of an elliptic operator of second order. Finite element approximation in space is…
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
A semilinear initial-boundary value problem with a Caputo time derivative of fractional order $\alpha\in(0,1)$ is considered, solutions of which typically exhibit a singular behaviour at an initial time. For L1-type discretizations of this…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
In this article we consider the system of equations {\Delta}u_{i}=p_{i}(x)f_{i}(u_{1},...,u_{d}) for i=1,...,d on R^{N}, N\geq3 and d\in{1,2,3,4,...}. We prove that the considered system has a bounded positive entire solution under some…