Shao-Liang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shao-Liang Zhang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Tomohiro Sogabe
Department of Applied Physics, Nagoya University, Nagoya, Japan
16 shared publications - Yuto Miyatake
D3 Center, The University of Osaka, Toyonaka, Japan
9 shared publications - Tomoya Kemmochi
Department of Applied Physics, Graduate School of Engineering Nagoya University Nagoya Japan
5 shared publications - Fuminori Tatsuoka
Department of Applied Physics Graduate School of Engineering Nagoya University Furo-cho Chikusa-ku 464-8603 Nagoya Japan
3 shared publications - Akira Imakura
Institute of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan
1 shared publication Dongjin Lee
Nagoya Univ, Grad Sch Engn, Chikusa Ku, Furo Cho, Nagoya, Aichi 4648603, Japan
1 shared publication
Latest Publications
- Open Access
- 23 December 2025
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 19 (1) , 192-218
Stability and Optimal Error Estimates Analysis of an LDG Method for the Stochastic Nonlinear KdV Equation
To address the computational challenges of stochastic nonlinear partial differential equations with high-order derivatives, a local discontinuous Galerkin method is proposed for the stochastic KdV equation. The method is proven to be $\mathcal{L}^2$-stable and to attain optimal error estimates of order $n+1$ measured in the mean-square norm when degree-$n$ polynomials are used. Temporal integration of the spatial semi-discrete stochastic system in the numerical experiments is carried out by using the implicit midpoint method. The simulation results verify the method's accuracy and its consistency with the theoretical analysis.- 23 December 2025
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 19 (1) , 192-218
Open AccessStability and Optimal Error Estimates Analysis of an LDG Method for the Stochastic Nonlinear KdV Equation
To address the computational challenges of stochastic nonlinear partial differential equations with high-order derivatives, a local discontinuous Galerkin method is proposed for the stochastic KdV equation. The method is proven to be $\mathcal{L}^2$-stable and to attain optimal error estimates of order $n+1$ measured in the mean-square norm when degree-$n$ polynomials are used. Temporal integration of the spatial semi-discrete stochastic system in the numerical experiments is carried out by using the implicit midpoint method. The simulation results verify the method's accuracy and its consistency with the theoretical analysis. - Open Access
- 1 June 2025
- Published by Walter de Gruyter GmbH in Quantum Information & Computation
- Vol. 25 (3) , 232-247
Variational Quantum Algorithm for Solving Second-Order Linear Differential Equations
Variational quantum algorithms (VQAs) have attracted attention as quantum algorithms employing on noisy intermediate-scale quantum devices. VQAs for solving the Poisson equation were recently proposed, as this method transforms the linear equation with a symmetric positive definite matrix obtained by discretizing the Poisson equation into a minimization problem. In this study, we propose a VQA for second-order linear differential equations including the Poisson equation on the basis of the referenced study, where the coefficient matrix obtained through discretization is a non-symmetric matrix. Furthermore, in our VQAs, we succeeded in decomposing the coefficient matrices arising from the periodic and the Dirichlet boundary condition into linear combinations of measurement operators and unitary matrices.
- 1 June 2025
- Published by Walter de Gruyter GmbH in Quantum Information & Computation
- Vol. 25 (3) , 232-247
Open AccessVariational Quantum Algorithm for Solving Second-Order Linear Differential Equations
Variational quantum algorithms (VQAs) have attracted attention as quantum algorithms employing on noisy intermediate-scale quantum devices. VQAs for solving the Poisson equation were recently proposed, as this method transforms the linear equation with a symmetric positive definite matrix obtained by discretizing the Poisson equation into a minimization problem. In this study, we propose a VQA for second-order linear differential equations including the Poisson equation on the basis of the referenced study, where the coefficient matrix obtained through discretization is a non-symmetric matrix. Furthermore, in our VQAs, we succeeded in decomposing the coefficient matrices arising from the periodic and the Dirichlet boundary condition into linear combinations of measurement operators and unitary matrices.
- Open Access
A tensor Alternating Anderson-Richardson method for solving multilinear systems with M-tensors
It is well-known that a multilinear system with a nonsingular M-tensor and a positive right-hand side has a unique positive solution. Tensor splitting methods generalizing the classical iterative methods for linear systems have been proposed for finding the unique positive solution. The Alternating Anderson-Richardson (AAR) method is an effective method to accelerate the classical iterative methods. In this study, we apply the idea of AAR for finding the unique positive solution quickly. We first present a tensor Richardson method based on tensor regular splittings, then apply Anderson acceleration to the tensor Richardson method and derive a tensor Anderson-Richardson method, finally, we periodically employ the tensor Anderson-Richardson method within the tensor Richardson method and propose a tensor AAR method. Numerical experiments show that the proposed method is effective in accelerating tensor splitting methods.
Open AccessA tensor Alternating Anderson-Richardson method for solving multilinear systems with M-tensors
It is well-known that a multilinear system with a nonsingular M-tensor and a positive right-hand side has a unique positive solution. Tensor splitting methods generalizing the classical iterative methods for linear systems have been proposed for finding the unique positive solution. The Alternating Anderson-Richardson (AAR) method is an effective method to accelerate the classical iterative methods. In this study, we apply the idea of AAR for finding the unique positive solution quickly. We first present a tensor Richardson method based on tensor regular splittings, then apply Anderson acceleration to the tensor Richardson method and derive a tensor Anderson-Richardson method, finally, we periodically employ the tensor Anderson-Richardson method within the tensor Richardson method and propose a tensor AAR method. Numerical experiments show that the proposed method is effective in accelerating tensor splitting methods.
- Open Access
- 1 January 2024
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 12 (1)
Computing the matrix exponential with the double exponential formula
This article considers the computation of the matrix exponential with numerical quadrature. Although several quadrature-based algorithms have been proposed, they focus on (near) Hermitian matrices. In order to deal with non-Hermitian matrices, we use another integral representation including an oscillatory term and consider applying the double exponential (DE) formula specialized to Fourier integrals. The DE formula transforms the given integral into another integral whose interval is infinite, and therefore, it is necessary to truncate the infinite interval. In this article, to utilize the DE formula, we analyze the truncation error and propose two algorithms. The first one approximates with the fixed mesh size, which is a parameter in the DE formula affecting the accuracy. The second one computes based on the first one with automatic selection of the mesh size depending on the given error tolerance.- 1 January 2024
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 12 (1)
Open AccessComputing the matrix exponential with the double exponential formula
This article considers the computation of the matrix exponential with numerical quadrature. Although several quadrature-based algorithms have been proposed, they focus on (near) Hermitian matrices. In order to deal with non-Hermitian matrices, we use another integral representation including an oscillatory term and consider applying the double exponential (DE) formula specialized to Fourier integrals. The DE formula transforms the given integral into another integral whose interval is infinite, and therefore, it is necessary to truncate the infinite interval. In this article, to utilize the DE formula, we analyze the truncation error and propose two algorithms. The first one approximates with the fixed mesh size, which is a parameter in the DE formula affecting the accuracy. The second one computes based on the first one with automatic selection of the mesh size depending on the given error tolerance. - Open Access
Matrix equation representation of the convolution equation and its unique solvability
We consider the convolution equation $F*X=B$, where $F\in\mathbb{R}^{3\times 3}$ and $B\in\mathbb{R}^{m\times n}$ are given, and $X\in\mathbb{R}^{m\times n}$ is to be determined. The convolution equation can be regarded as a linear system with a coefficient matrix of special structure. This fact has led to many studies including efficient numerical algorithms for solving the convolution equation. In this study, we show that the convolution equation can be represented as a generalized Sylvester equation. Furthermore, for some realistic examples arising from image processing, we show that the generalized Sylvester equation can be reduced to a simpler form, and analyze the unique solvability of the convolution equation.Open AccessMatrix equation representation of the convolution equation and its unique solvability
We consider the convolution equation $F*X=B$, where $F\in\mathbb{R}^{3\times 3}$ and $B\in\mathbb{R}^{m\times n}$ are given, and $X\in\mathbb{R}^{m\times n}$ is to be determined. The convolution equation can be regarded as a linear system with a coefficient matrix of special structure. This fact has led to many studies including efficient numerical algorithms for solving the convolution equation. In this study, we show that the convolution equation can be represented as a generalized Sylvester equation. Furthermore, for some realistic examples arising from image processing, we show that the generalized Sylvester equation can be reduced to a simpler form, and analyze the unique solvability of the convolution equation. - Open Access
Computing the matrix exponential with the double exponential formula
This paper considers the computation of the matrix exponential $\mathrm{e}^A$ with numerical quadrature. Although several quadrature-based algorithms have been proposed, they focus on (near) Hermitian matrices. In order to deal with non-Hermitian matrices, we use another integral representation including an oscillatory term and consider applying the double exponential (DE) formula specialized to Fourier integrals. The DE formula transforms the given integral into another integral whose interval is infinite, and therefore it is necessary to truncate the infinite interval. In this paper, to utilize the DE formula, we analyze the truncation error and propose two algorithms. The first one approximates $\mathrm{e}^A$ with the fixed mesh size which is a parameter in the DE formula affecting the accuracy. Second one computes $\mathrm{e}^A$ based on the first one with automatic selection of the mesh size depending on the given error tolerance.Open AccessComputing the matrix exponential with the double exponential formula
This paper considers the computation of the matrix exponential $\mathrm{e}^A$ with numerical quadrature. Although several quadrature-based algorithms have been proposed, they focus on (near) Hermitian matrices. In order to deal with non-Hermitian matrices, we use another integral representation including an oscillatory term and consider applying the double exponential (DE) formula specialized to Fourier integrals. The DE formula transforms the given integral into another integral whose interval is infinite, and therefore it is necessary to truncate the infinite interval. In this paper, to utilize the DE formula, we analyze the truncation error and propose two algorithms. The first one approximates $\mathrm{e}^A$ with the fixed mesh size which is a parameter in the DE formula affecting the accuracy. Second one computes $\mathrm{e}^A$ based on the first one with automatic selection of the mesh size depending on the given error tolerance. - Open Access
A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides
The block conjugate orthogonal conjugate gradient method (BCOCG) is recognized as a common method to solve complex symmetric linear systems with multiple right-hand sides. However, breakdown always occurs if the right-hand sides are rank deficient. In this paper, based on the orthogonality conditions, we present a breakdown-free BCOCG algorithm with new parameter matrices to handle rank deficiency. To improve the spectral properties of coefficient matrix A, a precondition version of the breakdown-free BCOCG is proposed in detail. We also give the relative algorithms for the block conjugate A-orthogonal conjugate residual method. Numerical results illustrate that when breakdown occurs, the breakdown-free algorithms yield faster convergence than the non-breakdown-free algorithms.
Open AccessA Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides
The block conjugate orthogonal conjugate gradient method (BCOCG) is recognized as a common method to solve complex symmetric linear systems with multiple right-hand sides. However, breakdown always occurs if the right-hand sides are rank deficient. In this paper, based on the orthogonality conditions, we present a breakdown-free BCOCG algorithm with new parameter matrices to handle rank deficiency. To improve the spectral properties of coefficient matrix A, a precondition version of the breakdown-free BCOCG is proposed in detail. We also give the relative algorithms for the block conjugate A-orthogonal conjugate residual method. Numerical results illustrate that when breakdown occurs, the breakdown-free algorithms yield faster convergence than the non-breakdown-free algorithms.
- Open Access
Modified Strang splitting for semilinear parabolic problems
We consider applying the Strang splitting to semilinear parabolic problems. The key ingredients of the Strang splitting are the decomposition of the equation into several parts and the computation of approximate solutions by combining the time evolution of each split equation. However, when the Dirichlet boundary condition is imposed, order reduction could occur due to the incompatibility of the split equations with the boundary condition. In this paper, to overcome the order reduction, a modified Strang splitting procedure is presented for the one-dimensional semilinear parabolic equation with first-order spatial derivatives, like the Burgers equation.
Open AccessModified Strang splitting for semilinear parabolic problems
We consider applying the Strang splitting to semilinear parabolic problems. The key ingredients of the Strang splitting are the decomposition of the equation into several parts and the computation of approximate solutions by combining the time evolution of each split equation. However, when the Dirichlet boundary condition is imposed, order reduction could occur due to the incompatibility of the split equations with the boundary condition. In this paper, to overcome the order reduction, a modified Strang splitting procedure is presented for the one-dimensional semilinear parabolic equation with first-order spatial derivatives, like the Burgers equation.
- Open Access
Algorithms for the computation of the matrix logarithm based on the double exponential formula
We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally employed; however, the convergence could be slow for ill-conditioned matrices. This effect may stem from the rapid change of the integrand values. To avoid such situations, we focus on the double exponential formula, which has been developed to address integrands with endpoint singularity. In order to utilize the double exponential formula, we must determine a suitable finite integration interval, which provides the required accuracy and efficiency. In this paper, we present a method for selecting a suitable finite interval based on an error analysis as well as two algorithms, and one of these algorithms addresses error control.
Open AccessAlgorithms for the computation of the matrix logarithm based on the double exponential formula
We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally employed; however, the convergence could be slow for ill-conditioned matrices. This effect may stem from the rapid change of the integrand values. To avoid such situations, we focus on the double exponential formula, which has been developed to address integrands with endpoint singularity. In order to utilize the double exponential formula, we must determine a suitable finite integration interval, which provides the required accuracy and efficiency. In this paper, we present a method for selecting a suitable finite interval based on an error analysis as well as two algorithms, and one of these algorithms addresses error control.