A5101783941- Matrix Theory and Algorithms
- Advanced Optimization Algorithms Research
- Tensor decomposition and applications
- Electromagnetic Scattering and Analysis
- Neural Networks and Applications
- Iterative Methods for Nonlinear Equations
- Optimization and Variational Analysis
- Sparse and Compressive Sensing Techniques
- Numerical methods in inverse problems
- Privacy-Preserving Technologies in Data
- Advanced Banach Space Theory
- Cryptography and Data Security
- Digital Filter Design and Implementation
- Model Reduction and Neural Networks
- Control Systems and Identification
- Algebraic and Geometric Analysis
- Blockchain Technology Applications and Security
- Robotic Mechanisms and Dynamics
- Spectral Theory in Mathematical Physics
- Web Data Mining and Analysis
- Advanced Decision-Making Techniques
- Network Packet Processing and Optimization
- Differential Equations and Boundary Problems
- Higher Education and Teaching Methods
- Human Pose and Action Recognition
Harbin Normal University
2015-2024
Shanghai Institute of Technology
2021-2023
University of Chinese Academy of Sciences
2021-2022
University of Jinan
2017
Changzhou Institute of Mechatronic Technology
2009-2012
Wenzhou University
2010-2011
Jiangsu Ocean University
2009-2011
Harbin Engineering University
2009-2010
Heilongjiang University of Science and Technology
2010
Heilongjiang Institute of Technology
2009
Predrag S. Stanimirovića* , Miroslav Ćirića, Vasilios N. Katsikisb, Chaoqian Lic & Haifeng Mada Faculty of Science and Mathematics, Department Computer Science, University Niš, Serbiab Economics, Division Mathematics Informatics, National Kapodistrian Athens, Greecec School Statistics, Yunnan University, Kunming, People's Republic Chinad Mathematical Harbin Normal Harbin, China
In this paper, we present the characterizations of core inverse by matrix equations. We give several representations for computing inverse. explore relationship between and nonsingularity a bordered Cramer rule. also an iterative formula sufficient condition convergence process.
We define and investigate the e-core inverse f-dual core in a ring with involution as extensions of dual inverse, respectively. Using these definitions, we present characterize partial order order. describe sets all elements Rickart ∗-ring which are below given element under New characterizations weighted-EP too.
Several new representations of the W-weighted Drazin inverse are introduced. These expressed in terms various matrix powers as well products involving Moore–Penrose and usual inverse. Also, properties generalized inverses which arise from derived investigated. The computational complexity efficiency proposed considered. Representations tested compared among themselves a substantial number randomly generated test examples.
<p style='text-indent:20px;'>The paper surveys, classifies and investigates theoretically numerically main classes of line search methods for unconstrained optimization. Quasi-Newton (QN) conjugate gradient (CG) are considered as representative effective numerical solving large-scale optimization problems. In this paper, we investigate, classify compare QN CG to present a global overview scientific advances in field. Some the most recent trends field presented. A number experiments is...
Abstract In this paper, we present a new characterization of the weighted core-EP inverse rectangular matrix. We also investigate perturbation bounds and approximations for inverse.
Abstract Recently, Bai and Wang [On parameterized inexact Uzawa methods for generalized saddle point problems, Linear Algebra Appl. 428 (2008), pp. 2900–2932] Gao Kong [Block diagonally preconditioned PIU of Math. Comput. 216 (2010), 1880–1887] discussed the (PIU) method (PPIU) method. In this paper, we further study block-diagonally solving singular give corresponding convergence analysis. Keywords: linear systemssaddle problemsPPIU methodconvergence 2000 AMS Subject Classifications :...
We present characterizations and representations for the CMP inverse. Also, we explore inverse of a block triangular matrix its sign pattern, propose successive squaring algorithm computing inverse, derive perturbation bounds continuity
According to known definition in the literature, W-weighted outer inverses of A is defined as WAW. We introduce and study more general weighted rectangular complex matrices. Introduced families include previous research two aspects from approaches. In first approach, for given matrices A, M, N, B, C, we define (M,N)-weighted (B,C)-inverse prove that it just inverse MAN with range R(B) null space N(C). Thus, generalizes notion and, finally, image kernel. give equivalent conditions existence...
In this paper, we investigate the theory of core-EP inverse third-order tensors via T-product (called T-core-EP inverse). A new decomposition called is given by T-Schur decomposition. canonical form and some characterizations are presented. Finally, establish perturbation bounds for inverse.
In this paper, for given tensors A,? and B = A+E, we investigate the perturbation bounds core inverse A# core-EP A+ under some conditions via Einstein product.
This study focuses on the faster exact single pattern string matching algorithms. In all solutions, two variants of BOM, EBOM and FBOM are very efficient. We improved them presented algorithms named Simplified-EBOM Simplified-FBOM through removing unnecessary branches accomplishing core calculation algorithm in a 1-dimensional array. The experimental results indicated that is fast for short patterns it 12% than its basis average.