Liping Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Liping Zhang has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Hung-Tsai Huang
Department of Data Science and Analytics, I-Shou University, Kaohsiung 84001, Taiwan
8 shared publications - Ming-Gong Lee
Department of Leisure and Tourism/PhD Program in Engineering Science, Chung Hua University, Hsin-Chu, Taiwan
7 shared publications - Eric King-Wah Chu
School of Mathematics, Monash University, Melbourne, Australia
4 shared publications - Yimin Wei
School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, P. R. of China
4 shared publications - Zi-Cai Li
Natl Sun Yat Sen Univ, Kaohsiung 80424, Taiwan
4 shared publications Zi-Cai Li
3 shared publications
Latest Publications
- Open Access
- 31 December 2024
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 131
Study on Discrete Null-Field Equation Methods for Bounded Simply Connected Domains: Better Locations of Source Nodes
The discrete null-field equation method (DNFEM) was proposed based on the null-field equation (NFE) of Green’s representation formulation, where only disk domains were discussed. However, the study of the DNFEM for bounded simply connected domains S is essential for practical applications. Since the source nodes must be located outside of a solution domain S, the first issue in computations is how to locate them. It includes two topics—Topic I: The source nodes must be located not only outside S but also outside the exterior boundary layers. The width of the exterior boundary layers is derived as , where N is the number of unknowns in the DNFEM. Topic II: There are numerous locations for source nodes outside the exterior boundary layers. Based on the sensitivity index, several better choices of pseudo-boundaries are studied for bounded simply connected domains. The advanced study of Topics I and II needs stability and error analysis. The bounds of condition numbers (Cond) are derived for bounded simply connected domains, and they are similar to those of the method of fundamental solutions (MFS). New error bounds are also provided for bounded simply connected domains. The thorough study of determining better locations of source nodes is also valid for the MFS and the discrete boundary integral equation method (DBIEM). The development of algorithms based on the NFE lags far behind that of the traditional boundary element method (BEM). Some progress has been made by following the MFS, and reported in this paper. From the theory and computations in this paper, the DNFEM may become a competent boundary method in scientific/engineering computing.- 31 December 2024
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 131
Open AccessStudy on Discrete Null-Field Equation Methods for Bounded Simply Connected Domains: Better Locations of Source Nodes
The discrete null-field equation method (DNFEM) was proposed based on the null-field equation (NFE) of Green’s representation formulation, where only disk domains were discussed. However, the study of the DNFEM for bounded simply connected domains S is essential for practical applications. Since the source nodes must be located outside of a solution domain S, the first issue in computations is how to locate them. It includes two topics—Topic I: The source nodes must be located not only outside S but also outside the exterior boundary layers. The width of the exterior boundary layers is derived as , where N is the number of unknowns in the DNFEM. Topic II: There are numerous locations for source nodes outside the exterior boundary layers. Based on the sensitivity index, several better choices of pseudo-boundaries are studied for bounded simply connected domains. The advanced study of Topics I and II needs stability and error analysis. The bounds of condition numbers (Cond) are derived for bounded simply connected domains, and they are similar to those of the method of fundamental solutions (MFS). New error bounds are also provided for bounded simply connected domains. The thorough study of determining better locations of source nodes is also valid for the MFS and the discrete boundary integral equation method (DBIEM). The development of algorithms based on the NFE lags far behind that of the traditional boundary element method (BEM). Some progress has been made by following the MFS, and reported in this paper. From the theory and computations in this paper, the DNFEM may become a competent boundary method in scientific/engineering computing. - 19 December 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 708, 489-512
On the local dimensions of solutions of Brent equations
- 19 December 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 708, 489-512
On the local dimensions of solutions of Brent equations
- 1 August 2024
- Published by Taylor & Francis in Experimental Mathematics
- p. 1-14
Deflation Conjecture and Local Dimensions of Brent Equations
- 1 August 2024
- Published by Taylor & Francis in Experimental Mathematics
- p. 1-14
Deflation Conjecture and Local Dimensions of Brent Equations
- Open Access
Deflation conjecture and local dimensions of Brent equations
In this paper, a classical deflation process raised by Dayton, Li and Zeng is realized for the Brent equations, which provides new bounds for local dimensions of the solution set. Originally, this deflation process focuses on isolated solutions. We generalize it to the case of irreducible components and a related conjecture is given. We analysis its realization and apply it to the Brent equations. The decrease of the nullities is easily observed. So the deflation process can be served as a useful tool for determining the local dimensions. In addition, our result implies that along with the decrease of the tensor rank, the singular solutions will become more and more.
Open AccessDeflation conjecture and local dimensions of Brent equations
In this paper, a classical deflation process raised by Dayton, Li and Zeng is realized for the Brent equations, which provides new bounds for local dimensions of the solution set. Originally, this deflation process focuses on isolated solutions. We generalize it to the case of irreducible components and a related conjecture is given. We analysis its realization and apply it to the Brent equations. The decrease of the nullities is easily observed. So the deflation process can be served as a useful tool for determining the local dimensions. In addition, our result implies that along with the decrease of the tensor rank, the singular solutions will become more and more.
- Open Access
Two classes of minimal generic fundamental invariants for tensors
Motivated by the problems raised by B\"{u}rgisser and Ikenmeyer, we discuss two classes of minimal generic fundamental invariants for tensors of order 3. The first one is defined on $\otimes^3 \mathbb{C}^m$, where $m=n^2-1$. We study its construction by obstruction design introduced by B\"{u}rgisser and Ikenmeyer, which partially answers one problem raised by them. The second one is defined on $\mathbb{C}^{\ell m}\otimes \mathbb{C}^{mn}\otimes \mathbb{C}^{n\ell}$. We study its evaluation on the matrix multiplication tensor $\langle\ell,m,n\rangle$ and unit tensor $\langle n^2 \rangle$ when $\ell=m=n$. The evaluation on the unit tensor leads to the definition of Latin cube and 3-dimensional Alon-Tarsi problem. We generalize some results on Latin square to Latin cube, which enrich the understanding of 3-dimensional Alon-Tarsi problem. It is also natural to generalize the constructions to tensors of other orders. We illustrate the distinction between even and odd dimensional generalizations by concrete examples. Finally, some open problems in related fields are raised.Open AccessTwo classes of minimal generic fundamental invariants for tensors
Motivated by the problems raised by B\"{u}rgisser and Ikenmeyer, we discuss two classes of minimal generic fundamental invariants for tensors of order 3. The first one is defined on $\otimes^3 \mathbb{C}^m$, where $m=n^2-1$. We study its construction by obstruction design introduced by B\"{u}rgisser and Ikenmeyer, which partially answers one problem raised by them. The second one is defined on $\mathbb{C}^{\ell m}\otimes \mathbb{C}^{mn}\otimes \mathbb{C}^{n\ell}$. We study its evaluation on the matrix multiplication tensor $\langle\ell,m,n\rangle$ and unit tensor $\langle n^2 \rangle$ when $\ell=m=n$. The evaluation on the unit tensor leads to the definition of Latin cube and 3-dimensional Alon-Tarsi problem. We generalize some results on Latin square to Latin cube, which enrich the understanding of 3-dimensional Alon-Tarsi problem. It is also natural to generalize the constructions to tensors of other orders. We illustrate the distinction between even and odd dimensional generalizations by concrete examples. Finally, some open problems in related fields are raised. - 6 September 2022
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (2)
Lower and upper bounds of condition number for Vandermonde‐wise matrices and method of fundamental solutions using pseudo radial‐lines
Consider the method of fundamental solutions (MFS) for 2D Laplace's equation in a bounded simply connected domain . In the standard MFS, the source nodes are located on a closed contour outside the domain boundary , which is called pseudo‐boundary. For circular, elliptic, and general closed pseudo‐boundaries, analysis and computation have been studied extensively. New locations of source nodes are proposed along two pseudo radial‐lines outside . Numerical results are very encouraging and promising. Since the success of the MFS mainly depends on stability, our efforts are focused on deriving the lower and upper bounds of condition number (Cond). The study finds stability properties of new Vandermonde‐wise matrices on nodes with . The Vandermonde‐wise matrix is called in this article if it can be decomposed into the standard Vandermonde matrix. New lower and upper bounds of Cond are first derived for the standard Vandermonde matrix, and then for new algorithms of the MFS using two pseudo radial‐lines. Both lower and upper bounds of Cond are intriguing in the stability study for the MFS. Numerical experiments are carried out to verify the stability analysis made. Since the fundamental solutions (as ) are the basis functions of the MFS, new Vandermonde‐wise matrices are found. Since the nodes with may come from approximations and interpolations by the Laurent polynomials with singular part, the conclusions in this article are important not only to the MFS but also to matrix analysis.
- 6 September 2022
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (2)
Lower and upper bounds of condition number for Vandermonde‐wise matrices and method of fundamental solutions using pseudo radial‐lines
Consider the method of fundamental solutions (MFS) for 2D Laplace's equation in a bounded simply connected domain . In the standard MFS, the source nodes are located on a closed contour outside the domain boundary , which is called pseudo‐boundary. For circular, elliptic, and general closed pseudo‐boundaries, analysis and computation have been studied extensively. New locations of source nodes are proposed along two pseudo radial‐lines outside . Numerical results are very encouraging and promising. Since the success of the MFS mainly depends on stability, our efforts are focused on deriving the lower and upper bounds of condition number (Cond). The study finds stability properties of new Vandermonde‐wise matrices on nodes with . The Vandermonde‐wise matrix is called in this article if it can be decomposed into the standard Vandermonde matrix. New lower and upper bounds of Cond are first derived for the standard Vandermonde matrix, and then for new algorithms of the MFS using two pseudo radial‐lines. Both lower and upper bounds of Cond are intriguing in the stability study for the MFS. Numerical experiments are carried out to verify the stability analysis made. Since the fundamental solutions (as ) are the basis functions of the MFS, new Vandermonde‐wise matrices are found. Since the nodes with may come from approximations and interpolations by the Laurent polynomials with singular part, the conclusions in this article are important not only to the MFS but also to matrix analysis.
- 23 April 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 91 (2) , 895-932
Spurious eigenvalue-free algorithms of the method of fundamental solutions for solving the Helmholtz equation in bounded multiply connected domains
- 23 April 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 91 (2) , 895-932
Spurious eigenvalue-free algorithms of the method of fundamental solutions for solving the Helmholtz equation in bounded multiply connected domains
- 10 January 2022
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 136, 93-115
New locations of source nodes for method of fundamental solutions solving Laplace’s equation; pseudo radial-lines
- 10 January 2022
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 136, 93-115
New locations of source nodes for method of fundamental solutions solving Laplace’s equation; pseudo radial-lines
- Open Access
- 1 January 2022
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 39 (39) , 80-95
Numerical Experiments of the Dual Null Field Method for Dirichlet Problems of Laplace’s Equation in Elliptic Domains with Elliptic Holes
The bulletin of Irkutsk State University. Series «Mathematics»
- 1 January 2022
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 39 (39) , 80-95
Open AccessNumerical Experiments of the Dual Null Field Method for Dirichlet Problems of Laplace’s Equation in Elliptic Domains with Elliptic Holes
The bulletin of Irkutsk State University. Series «Mathematics»