SearcharxivSearch

arXiv subjects

Prosper Torsu

Publications and source records attributed to Prosper Torsu.

3 recordsLinked to original sources

A Spectral Low-Mode Reduced Method for Elliptic Problems

We develop a spectral low-mode reduced solver for second-order elliptic boundary value problems with spatially varying diffusion coefficients. The approach projects standard finite difference or finite element discretization onto a global coarse space spanned by the lowest Dirichlet Laplacian eigenmodes, yielding an analytic reduced model that requires no training data and preserves coefficient heterogeneity through an exact Galerkin projection. The reduced solution is energy-optimal in the selected subspace and, for $H^2$-regular solutions, the truncation error associated with discarded modes satisfies a $\sqrt{\log M}/M$ decay in the $H_0^1$ norm. For uniformly stable reduced bases, the projected operator is well conditioned with respect to mesh refinement, and numerical experiments corroborate the predicted accuracy and demonstrate meaningful speedups over sparse direct solvers, with favorable performance relative to multigrid and deflation-based Krylov methods for heterogeneous coefficients in the tested setups.

math.NA

An iterative method for solving elliptic BVP in one-dimension

This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally superior to the original formulation as less computations are required to obtain an approximation of the same accuracy. Convergence of the method is justified and supported by some theoretical results. We show that for a sufficiently smooth forcing data, the method always converge for a relatively small truncation order. The method is tested using some problems with exact solutions.

math.AP

On variational iterative methods for semilinear problems

This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into linear systems which are solvable using fast Poisson solvers. Theoretical justifications are provided and supported by several experiments. Numerical results show that the method is not only computationally less expensive, but also yields accurate approximations.

math.NA