Results 11 to 20 of about 74,666 (264)
Matrix partitions of split graphs
Discrete Applied Mathematics, 2014 Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split graphs. Previously such a result was only known for the class of cographs.
Tomás Feder, Pavol Hell, Oren Shklarsky
openaire +2 more sources
A Data-Driven Parameter Prediction Method for HSS-Type Methods
Mathematics, 2022 Some matrix-splitting iterative methods for solving systems of linear equations contain parameters that need to be specified in advance, and the choice of these parameters directly affects the efficiency of the corresponding iterative methods. This paper
Kai Jiang, Jianghao Su, Juan Zhang
doaj +1 more source
A Generalized Matrix Splitting Algorithm
CoRR, 2018 Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\ell_1$ norm regularized optimization, and $\ell_0$ norm regularized optimization as special cases.
Ganzhao Yuan +3 more
openaire +2 more sources
Splitting numerical integration for matrix completion
CoRR, 2022 Low rank matrix approximation is a popular topic in machine learning. In this paper, we propose a new algorithm for this topic by minimizing the least-squares estimation over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical gradient descent within the framework of optimization on manifolds.
openaire +2 more sources
A new generalized shift-splitting method for nonsymmetric saddle point problems
Advances in Mechanical Engineering, 2022 Recently, Huang and Huang [ Journal of Computational and Applied Mathematics , 328 (2018) 381–399] proposed a modified generalized shift-splitting preconditioned (denoted by MGSSP) method for solving large sparse saddle point problems, and gave the ...
Tao Wei, Li-Tao Zhang
doaj +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation
Frontiers in Chemistry, 2023 The sum of the absolute eigenvalues of the adjacency matrix make up graph energy. The greatest absolute eigenvalue of the adjacency matrix is represented by the spectral radius of the graph.
Muhammad Mobeen Munir, Urwah Tul Wusqa
doaj +1 more source
Computing Exponential for Iterative Splitting Methods: Algorithms and Applications
Journal of Applied Mathematics, 2011 Iterative splitting methods have a huge amount to compute matrix exponential. Here, the acceleration and recovering of higher-order schemes can be achieved.
Jürgen Geiser
doaj +1 more source
Computation, 2023 We propose two accurate and efficient spectral collocation techniques based on a (novel) domain-splitting strategy to handle a nonlinear fractional system consisting of three ODEs arising in financial modeling and with chaotic behavior.
Mohammad Izadi, Hari Mohan Srivastava
doaj +1 more source
Random matrix ensembles with split limiting behavior [PDF]
Random Matrices: Theory and Applications, 2018 We introduce a new family of [Formula: see text] random real symmetric matrix ensembles, the [Formula: see text]-checkerboard matrices, whose limiting spectral measure has two components which can be determined explicitly. All but [Formula: see text] eigenvalues are in the bulk, and their behavior, appropriately normalized, converges to the semi-circle
Burkhardt, Paula +8 more
openaire +2 more sources
Comparison Theorems of Spectral Radius for Splittings of Matrices
Journal of Applied Mathematics, 2014 A class of the iteration method from the double splitting of coefficient matrix for solving the linear system is further investigated. By structuring a new matrix, the iteration matrix of the corresponding double splitting iteration method is presented ...
Cui-Xia Li, Su-Hua Li
doaj +1 more source