Changfeng Ma
Orcid: 0000-0002-5936-789X
According to our database1,
Changfeng Ma
authored at least 144 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
A novel predefined-time noise-tolerant zeroing neural network for solving time-varying generalized linear matrix equations.
J. Frankl. Inst., November, 2023
Quasi Non-Negative Quaternion Matrix Factorization with Application to Color Face Recognition.
J. Sci. Comput., May, 2023
On the minimum-norm least squares solution of the complex generalized coupled sylvester matrix equations.
J. Frankl. Inst., March, 2023
J. Frankl. Inst., 2023
Symmetric Shape-Preserving Autoencoder for Unsupervised Real Scene Point Cloud Completion.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023
2022
Optim. Methods Softw., 2022
A finite iterative algorithm for the general discrete-time periodic Sylvester matrix equations.
J. Frankl. Inst., 2022
Factor gradient iterative algorithm for solving a class of discrete periodic Sylvester matrix equations.
J. Frankl. Inst., 2022
On the relaxed gradient-based iterative methods for the generalized coupled Sylvester-transpose matrix equations.
J. Frankl. Inst., 2022
Generalized conjugate direction algorithm for solving generalized coupled Sylvester transpose matrix equations over reflexive or anti-reflexive matrices.
J. Frankl. Inst., 2022
Completing Partial Point Clouds with Outliers by Collaborative Completion and Segmentation.
CoRR, 2022
Adaptive parameter based matrix splitting iteration method for the large and sparse linear systems.
Comput. Math. Appl., 2022
Unsupervised Point Cloud Completion and Segmentation by Generative Adversarial Autoencoding Network.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
2021
An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor.
J. Comput. Appl. Math., 2021
J. Comput. Appl. Math., 2021
A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations.
CoRR, 2021
Comput. Math. Appl., 2021
A modified generalized shift-splitting iteration method for complex symmetric linear systems.
Appl. Math. Lett., 2021
An iterative algorithm for generalized Hamiltonian solution of a class of generalized coupled Sylvester-conjugate matrix equations.
Appl. Math. Comput., 2021
2020
The BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equations.
J. Frankl. Inst., 2020
Some accelerated iterative algorithms for solving nonsymmetric algebraic Riccati equations arising in transport theory.
Int. J. Comput. Math., 2020
Comput. Appl. Math., 2020
The inexact Euler-extrapolated block preconditioners for a class of complex linear systems.
Appl. Math. Lett., 2020
Appl. Math. Comput., 2020
A class of efficient parameterized shift-splitting preconditioners for block two-by-two linear systems.
Appl. Math. Comput., 2020
Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations.
Appl. Math. Comput., 2020
2019
Krylov subspace methods to solve a class of tensor equations via the Einstein product.
Numer. Linear Algebra Appl., 2019
Efficient parameterized rotated shift-splitting preconditioner for a class of complex symmetric linear systems.
Numer. Algorithms, 2019
Spectral analysis of the preconditioned system for the 3 × 3 block saddle point problem.
Numer. Algorithms, 2019
Finite iterative algorithm for the symmetric periodic least squares solutions of a class of periodic Sylvester matrix equations.
Numer. Algorithms, 2019
The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint.
J. Glob. Optim., 2019
The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix.
Int. J. Comput. Math., 2019
On semi-convergence of parameterized SHSS method for a class of singular complex symmetric linear systems.
Comput. Math. Appl., 2019
Comput. Math. Appl., 2019
An accelerated cyclic-reduction-based solvent method for solving quadratic eigenvalue problem of gyroscopic systems.
Comput. Math. Appl., 2019
Convergent conditions of the generalized Newton method for absolute value equation over second order cones.
Appl. Math. Lett., 2019
Appl. Math. Comput., 2019
Proceedings of the New Knowledge in Information Systems and Technologies, 2019
2018
The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems.
Numer. Algorithms, 2018
Some iterative methods for the largest positive definite solution to a class of nonlinear matrix equation.
Numer. Algorithms, 2018
On the eigenvalues of the saddle point matrices discretized from Navier-Stokes equations.
Numer. Algorithms, 2018
An iterative algorithm for the least Frobenius norm Hermitian and generalized skew Hamiltonian solutions of the generalized coupled Sylvester-conjugate matrix equations.
Numer. Algorithms, 2018
The relaxed gradient-based iterative algorithms for a class of generalized coupled Sylvester-conjugate matrix equations.
J. Frankl. Inst., 2018
J. Comput. Appl. Math., 2018
J. Comput. Appl. Math., 2018
Spectral Analysis, Properties and Nonsingular Preconditioners for Singular Saddle Point Problems.
Comput. Methods Appl. Math., 2018
An iterative method for obtaining the Least squares solutions of quadratic inverse eigenvalue problems over generalized Hamiltonian matrix with submatrix constraints.
Comput. Math. Appl., 2018
BCR method for solving generalized coupled Sylvester equations over centrosymmetric or anti-centrosymmetric matrix.
Comput. Math. Appl., 2018
The Uzawa-PPS iteration methods for nonsingular and singular non-Hermitian saddle point problems.
Comput. Math. Appl., 2018
Comput. Math. Appl., 2018
Gradient-based iterative algorithms for generalized coupled Sylvester-conjugate matrix equations.
Comput. Math. Appl., 2018
On Euler-extrapolated Hermitian/skew-Hermitian splitting method for complex symmetric linear systems.
Appl. Math. Lett., 2018
A class of accelerated parameterized inexact Uzawa algorithms for complex symmetric linear systems.
Appl. Math. Comput., 2018
The preconditioned iterative methods with variable parameters for saddle point problem.
Appl. Math. Comput., 2018
An iterative algorithm for the least Frobenius norm least squares solution of a class of generalized coupled Sylvester-transpose linear matrix equations.
Appl. Math. Comput., 2018
Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester-conjugate matrix equations.
Appl. Math. Comput., 2018
2017
The parameterized upper and lower triangular splitting methods for saddle point problems.
Numer. Algorithms, 2017
An inexact modified relaxed splitting preconditioner for the generalized saddle point problems from the incompressible Navier-Stokes equations.
Numer. Algorithms, 2017
Symmetric least squares solution of a class of Sylvester matrix equations via MINIRES algorithm.
J. Frankl. Inst., 2017
Generalized conjugate direction method for solving a class of generalized coupled Sylvester-conjugate transpose matrix equations over generalized Hamiltonian matrices.
Comput. Math. Appl., 2017
Semi-convergence analysis of parameterized ULT splitting iteration methods for singular saddle point problems.
Comput. Math. Appl., 2017
Analysis on block diagonal and triangular preconditioners for a PML system of an electromagnetic scattering problem.
Comput. Math. Appl., 2017
Analysis on inexact block diagonal preconditioners for elliptic PDE-constrained optimization problems.
Comput. Math. Appl., 2017
On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations.
Comput. Math. Appl., 2017
Minimum-norm Hamiltonian solutions of a class of generalized Sylvester-conjugate matrix equations.
Comput. Math. Appl., 2017
A matrix CRS iterative method for solving a class of coupled Sylvester-transpose matrix equations.
Comput. Math. Appl., 2017
Appl. Math. Comput., 2017
The dimensional splitting iteration methods for solving saddle point problems arising from time-harmonic eddy current models.
Appl. Math. Comput., 2017
2016
The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
Numer. Linear Algebra Appl., 2016
Numer. Algorithms, 2016
A modified positive-definite and skew-Hermitian splitting preconditioner for generalized saddle point problems from the Navier-Stokes equation.
Numer. Algorithms, 2016
A generalization of the HSS-based sequential two-stage method for solving non-Hermitian saddle point problems.
Numer. Algorithms, 2016
Combined new nonnegative matrix factorization algorithms with two-dimensional nonnegative matrix factorization for image processing.
Multim. Tools Appl., 2016
J. Comput. Appl. Math., 2016
Int. J. Comput. Math., 2016
A parameterized SHSS iteration method for a class of complex symmetric system of linear equations.
Comput. Math. Appl., 2016
AOR-Uzawa iterative method for a class of complex symmetric linear system of equations.
Comput. Math. Appl., 2016
Preconditioned AHSS-PU alternating splitting iterative methods for saddle point problems.
Appl. Math. Comput., 2016
The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation.
Appl. Math. Comput., 2016
2015
Optim. Lett., 2015
Numer. Linear Algebra Appl., 2015
A globally convergent damped Gauss-Newton method for solving the extended linear complementarity problem.
J. Num. Math., 2015
The scaling conjugate gradient iterative method for two types of linear matrix equations.
Comput. Math. Appl., 2015
Two structure-preserving-doubling like algorithms for obtaining the positive definite solution to a class of nonlinear matrix equation.
Comput. Math. Appl., 2015
Appl. Math. Lett., 2015
Appl. Math. Comput., 2015
The MGPBiCG method for solving the generalized coupled Sylvester-conjugate matrix equations.
Appl. Math. Comput., 2015
A modified product preconditioner for indefinite and asymmetric generalized saddle-point matrices.
Appl. Math. Comput., 2015
Alternating direction method for generalized Sylvester matrix equation AXB + CYD = E.
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
Parallel multisplitting iteration methods based on M-splitting for the PageRank problem.
Appl. Math. Comput., 2015
The nonlinear inexact Uzawa hybrid algorithms based on one-step Newton method for solving nonlinear saddle-point problems.
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
The least squares anti-bisymmetric solution and the optimal approximation solution for Sylvester equation.
Appl. Math. Comput., 2015
A corrected Levenberg-Marquardt algorithm with a nonmonotone line search for the system of nonlinear equations.
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
2014
Optim. Lett., 2014
Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory.
Numer. Linear Algebra Appl., 2014
On normal and skew-Hermitian splitting iteration methods for large sparse continuous Sylvester equations.
J. Comput. Appl. Math., 2014
Iterative Methods to Solve the Generalized Coupled Sylvester-Conjugate Matrix Equations for Obtaining the Centrally Symmetric (Centrally Antisymmetric) Matrix Solutions.
J. Appl. Math., 2014
Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix.
Comput. Math. Appl., 2014
A preconditioned nested splitting conjugate gradient iterative method for the large sparse generalized Sylvester equation.
Comput. Math. Appl., 2014
The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations.
Comput. Math. Appl., 2014
Appl. Math. Comput., 2014
On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems.
Appl. Math. Comput., 2014
Exceptional family and solvability of the second-order cone complementarity problems.
Appl. Math. Comput., 2014
A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function.
Appl. Math. Comput., 2014
2013
A nonmonotone trust region method with new inexact line search for unconstrained optimization.
Numer. Algorithms, 2013
2012
Numerical Study of the Nonlinear Combined Sine-Cosine-Gordon Equation with the Lattice Boltzmann Method.
J. Sci. Comput., 2012
An application of H differentiability to generalized complementarity problems over symmetric cones.
Comput. Math. Appl., 2012
The numerical study of a regularized smoothing Newton method for solving P<sub>0</sub>-NCP based on the generalized smoothing Fischer-Burmeister function.
Appl. Math. Comput., 2012
2011
A regularized smoothing Newton method for solving the symmetric cone complementarity problem.
Math. Comput. Model., 2011
A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation.
J. Glob. Optim., 2011
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0-function.
J. Glob. Optim., 2011
A modified smoothing and regularized Newton method for monotone second-order cone complementarity problems.
Comput. Math. Appl., 2011
A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem.
Appl. Math. Comput., 2011
2010
J. Glob. Optim., 2010
A predictor-corrector smoothing Newton method for solving the mixed complementarity problem with a <i>P</i><sub>0</sub>-function.
Int. J. Comput. Math., 2010
A new modified one-step smoothing Newton method for solving the general mixed complementarity problem.
Appl. Math. Comput., 2010
A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities.
Appl. Math. Comput., 2010
2009
One-step smoothing Newton method for solving the mixed complementarity problem with a P<sub>0</sub> function.
Appl. Math. Comput., 2009
2008
The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem.
Appl. Math. Comput., 2008
A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem.
Appl. Math. Comput., 2008
A globally convergent Levenberg-Marquardt method for the least l<sub>2</sub>-norm solution of nonlinear inequalities.
Appl. Math. Comput., 2008
The finite element analysis of a decoupled T-psi scheme for solving eddy-current problems.
Appl. Math. Comput., 2008
A note on modified Householder iterative method free from second derivatives for nonlinear equations.
Appl. Math. Comput., 2008
2007
Finite element analysis of an A-Phi method for time-dependent Maxwell's equations based on explicit-magnetic-field scheme.
Appl. Math. Comput., 2007
A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem.
Appl. Math. Comput., 2007
Appl. Math. Comput., 2007
Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem.
Appl. Math. Comput., 2007
Appl. Math. Comput., 2007
A filter method for solving nonlinear complementarity problems based on derivative-free line search.
Appl. Math. Comput., 2007
On the Convergence of a New Smoothing Levenberg-Marquardt Method for the Nonlinear Inequalities.
Proceedings of the Third International Conference on Natural Computation, 2007
2006
Appl. Math. Comput., 2006
Convergence of finite element A-phi method for solving time-dependent Maxwell's equations.
Appl. Math. Comput., 2006
2005
Math. Comput. Model., 2005
Appl. Math. Comput., 2005
Appl. Math. Comput., 2005
2004
H-based A-phi approaches of approximating eddy current problem by way of solving different systems inside and outside the conductor.
Appl. Math. Comput., 2004