Related papers: Algebraic Multiscale Method for one--dimensional e…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
A general method to generate a centrosymmetric matrix associated with the solving of partial differential equation (PDE) on an irreducible domain by means of a linear equation system is proposed. The method applies to any PDE for which both…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…
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…
This survey highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matrix, one first compresses it to a much smaller matrix by multiplying it by a…
In this paper we present a new multiscale discontinuous Petrov--Galerkin method (MsDPGM) for multiscale elliptic problems. This method utilizes the classical oversampling multiscale basis in the framework of Petrov--Galerkin version of…
This paper introduces two decomposition-based methods for two-block mixed-integer linear programs (MILPs), which aim to take advantage of separable structures of the original problem by solving a sequence of lower-dimensional MILPs. The…
The present paper gives a review of our recent progress and latest results for novel linear-algebraic algorithms and its application to large-scale quantum material simulations or electronic structure calculations. The algorithms are…
The focus in this paper is on elliptic homogenization of a certain kind of possibly non-periodic problems. A non-periodic and two-dimensional example is studied, where we numerically illustrate the homogenized matrix.
This paper proposes a matrix-free residual evaluation technique for the hybridizable discontinuous Galerkin method requiring a number of operations scaling only linearly with the number of degrees of freedom. The method results from…
We propose a novel numerical algorithm utilizing model reduction for computing solutions to stationary partial differential equations involving the spectral fractional Laplacian. Our approach utilizes a known characterization of the…
We consider within a finite element approach the usage of different adaptively refined meshes for different variables in systems of nonlinear, time-depended PDEs. To resolve different solution behaviours of these variables, the meshes can…
We present a novel algorithm based on the ensemble Kalman filter to solve inverse problems involving multiscale elliptic partial differential equations. Our method is based on numerical homogenization and finite element discretization and…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We consider finite-dimensional reductions of an integral operator with the elliptic hypergeometric kernel describing the most general known solution of the Yang-Baxter equation with a rank 1 symmetry algebra. The reduced R-operators…
Deep learning method is of great importance in solving partial differential equations. In this paper, inspired by the failure-informed idea proposed by Gao et.al. (SIAM Journal on Scientific Computing 45(4)(2023)) and as an improvement, a…
Two methods of level set type are proposed for solving the Cauchy problem for an elliptic equation. Convergence and stability results for both methods are proven, characterizing the iterative methods as regularization methods for this…
The paper studies a method for solving elliptic partial differential equations posed on hypersurfaces in $\mathbb{R}^N$, $N=2,3$. The method allows a surface to be given implicitly as a zero level of a level set function. A surface equation…
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a…