Skip to main content

14 Result(s)

within Article Remove this filter Hongyuan Zha Remove this filter

and

  1. No Access

    Article

    Learning structured communication for multi-agent reinforcement learning

    This work explores the large-scale multi-agent communication mechanism for multi-agent reinforcement learning (MARL). We summarize the general topology categories for communication structures, which are often ...

    Junjie Sheng, **angfeng Wang, Bo **… in Autonomous Agents and Multi-Agent Systems (2022)

  2. No Access

    Article

    Simple and effective variational optimization of surface and volume triangulations

    Optimizing surface and volume triangulations is critical for many advanced numerical simulation applications. We present a variational approach for smoothing triangulated surface and volume meshes to improve t...

    **angmin Jiao, Duo Wang, Hongyuan Zha in Engineering with Computers (2011)

  3. No Access

    Article

    Analysis of an alignment algorithm for nonlinear dimensionality reduction

    The goal of dimensionality reduction or manifold learning for a given set of high-dimensional data points, is to find a low-dimensional parametrization for them. Usually it is easy to carry out this parametriz...

    Qiang Ye, Hongyuan Zha, Ren-Cang Li in BIT Numerical Mathematics (2007)

  4. Article

    Open Access

    Towards Inferring Protein Interactions: Challenges and Solutions

    Discovering interacting proteins has been an essential part of functional genomics. However, existing experimental techniques only uncover a small portion of any interactome. Furthermore, these data often have...

    Ya Zhang, Hongyuan Zha, Chao-Hsien Chu… in EURASIP Journal on Advances in Signal Proc… (2006)

    Download PDF (2984 KB)

  5. No Access

    Article

    Linear low-rank approximation and nonlinear dimensionality reduction

    We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-r...

    Zhenyue Zhang, Hongyuan Zha in Science in China Series A: Mathematics (2004)

  6. No Access

    Article

    Modifying the generalized singular value decomposition with application with application in direction-of-arrival finding

    We consider updating and downdating problems for the generalized singular value decomposition (GSVD) of matrix pairs when new rows are added to one of the matrices or old rows are deleted. Two classes of algor...

    Hongyuan Zha, Zhenyue Zhang in BIT Numerical Mathematics (1998)

  7. No Access

    Article

    Computing the optimal commuting matrix pairs

    A matrix can be modified by an additive perturbation so that it commutes with any given matrix. In this paper, we discuss several algorithms for computing the smallest perturbation in the Frobenius norm for a ...

    Hongyuan Zha, Zhenyue Zhang in BIT Numerical Mathematics (1997)

  8. No Access

    Article

    An algorithm and a stability theory for downdating the ULV decomposition

    An alternative to performing the singular value decomposition is to factor a matrixA into $$A = U\left( {\begin{array}{*{20}c} C \\...

    Jesse L. Barlow, Peter A. Yoon, Hongyuan Zha in BIT Numerical Mathematics (1996)

  9. No Access

    Article

    Computing the generalized singular values/vectors of large sparse or structured matrix pairs

    We present a numerical algorithm for computing a few extreme generalized singular values and corresponding vectors of a sparse or structured matrix pair \(\{A,B\}\) . The algori...

    Hongyuan Zha in Numerische Mathematik (1996)

  10. No Access

    Article

    A note on constructing a symmetric matrix with specified diagonal entries and eigenvalues

    A finite step algorithm is given such that for any two vectorsa, λ ∈R n witha majorized by λ, it computes a symmetric matrixH ∈R n x n with ...

    Hongyuan Zha, Zhenyue Zhang in BIT Numerical Mathematics (1995)

  11. No Access

    Article

    A look-ahead algorithm for the solution of general Hankel systems

    The solution of systems of linear equations with Hankel coefficient matrices can be computed with onlyO(n 2) arithmetic operations, as compared toO(n 3) operations for the general cases. However, the classical Ha...

    Roland W. Freund, Hongyuan Zha in Numerische Mathematik (1993)

  12. No Access

    Article

    An efficient Total Least Squares algorithm based on a rank-revealing two-sided orthogonal decomposition

    Solving Total Least Squares (TLS) problemsAX≈B requires the computation of the noise subspace of the data matrix [A;B]. The widely used tool for doing this is the Singular Value Decomposition (SVD). However, the ...

    Sabine Van Huffel, Hongyuan Zha in Numerical Algorithms (1993)

  13. No Access

    Article

    The product-product singular value decomposition of matrix triplets

    A new decomposition of a matrix triplet (A, B, C) corresponding to the singular value decomposition of the matrix productABC is developed in this paper, which will be termed theProduct-Product Singular Value Deco...

    Hongyuan Zha in BIT Numerical Mathematics (1991)

  14. No Access

    Article

    ImplicitQR factorization of a product of three matrices

    We present a numerical algorithm for computing the implicit QR factorization of a product of three matrices, and we illustrate the technique by applying it to the generalized total least squares and the restri...

    Hongyuan Zha in BIT Numerical Mathematics (1991)