相关论文: An RADI-type method for stochastic continuous-time…
In this work, we investigate a stochastic gradient descent method for solving inverse problems that can be written as systems of linear or nonlinear ill-posed equations in Banach spaces. The method uses only a randomly selected equation at…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
In this work we propose and analyze a weighted proper orthogonal decomposition method to solve elliptic partial differential equations depending on random input data, for stochastic problems that can be transformed into parametric systems.…
The Reduced Basis (RB) method is a well established method for the model order reduction of problems formulated as parametrized partial differential equations. One crucial requirement for the application of RB schemes is the availability of…
Simultaneous stabilization problem arises in various systems and control applications. This paper introduces a new approach to addressing this problem in the multivariable scenario, building upon our previous findings in the scalar case.…
In this paper, we present new stochastic methods for solving two important classes of nonconvex optimization problems. We first introduce a randomized accelerated proximal gradient (RapGrad) method for solving a class of nonconvex…
In this paper we mainly propose efficient and reliable numerical algorithms for solving stochastic continuous-time algebraic Riccati equations (SCARE) typically arising from the differential statedependent Riccati equation technique from…
We study the convergence rates of the semi-discrete (SD) method originally proposed in Halidias (2012), Semi-discrete approximations for stochastic differential equations and applications, International Journal of Computer Mathematics,…
Recently there has been a growing interest in computational methods for quantum scattering equations that avoid the traditional decomposition of wave functions and scattering amplitudes into partial waves.The aim of the present work is to…
Multi-relational learning has received lots of attention from researchers in various research communities. Most existing methods either suffer from superlinear per-iteration cost, or are sensitive to the given ranks. To address both issues,…
This paper is concerned with the quasi-linear reflected backward stochastic partial differential equation (RBSPDE for short). Basing on the theory of backward stochastic partial differential equation and the parabolic capacity and…
The low-rank approximation is a complexity reduction technique to approximate a tensor or a matrix with a reduced rank, which has been applied to the simulation of high dimensional problems to reduce the memory required and computational…
The simulation of high-dimensional problems with manageable computational resource represents a long-standing challenge. In a series of our recent work [25, 17, 18, 24], a class of sparse grid DG methods has been formulated for solving…
In this paper, we focus on using optimization methods to solve matrix equations by transforming the problem of solving the Sylvester matrix equation or continuous algebraic Riccati equation into an optimization problem. Initially, we use a…
In this paper, we propose a novel variable-separation (NVS) method for generic multivariate functions. The idea of NVS is extended to to obtain the solution in tensor product structure for stochastic partial differential equations (SPDEs).…
This paper considers master equations for Markovian kinetic schemes that possess the detailed balance property. Chemical kinetics, as a prime example, often yields large-scale, highly stiff equations. Based on chemical intuitions, Sumiya et…
In this paper a recursive algorithm is presented for evaluating multivariate Pad\'e approximants (of the rectangular type described in the work of Lutterodt) which is analogous to the Jacobi formula for univariate Pad\'e approximants. This…
In this paper, we show that simple {Stochastic} subGradient Decent methods with multiple Restarting, named {\bf RSGD}, can achieve a \textit{linear convergence rate} for a class of non-smooth and non-strongly convex optimization problems…
For nonlinear equations, the homotopy methods (continuation methods) are popular in engineering fields since their convergence regions are large and they are quite reliable to find a solution. The disadvantage of the classical homotopy…
In this paper, we design and analyze a novel spectral method for the subdiffusion equation. As it has been known, the solutions of this equation are usually singular near the initial time. Consequently, direct application of the traditional…