Results 31 to 40 of about 11,812,491 (293)
Journal of Mathematics, 2021 For solving the large sparse linear systems with 2×2 block structure, the generalized successive overrelaxation (GSOR) iteration method is an efficient iteration method. Based on the GSOR method, the PGSOR method introduces a preconditioned matrix with a
Yu-Ye Feng, Qing-Biao Wu
doaj +1 more source
Axioms, 2021 We develop a local convergence of an iterative method for solving nonlinear least squares problems with operator decomposition under the classical and generalized Lipschitz conditions. We consider the case of both zero and nonzero residuals and determine
Ioannis K. Argyros +4 more
doaj +1 more source
Mathematics, 2023 Some iterative schemes with memory were designed for approximating the inverse of a nonsingular square complex matrix and the Moore–Penrose inverse of a singular square matrix or an arbitrary m×n complex matrix.
Alicia Cordero +3 more
doaj +1 more source
Numerical study of the stationary generalized viscoplastic fluid flows
Alexandria Engineering Journal, 2018 In this work, numerical schemes for the generalized stationary regularized viscoplastic fluids equations with highly nonlinear viscosities are analyzed.
Mohamed El-Borhamy
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
A Newton Method for Linear Programming [PDF]
, 2002 A fast Newton method is proposed for solving linear programs with a very large ( 106) number of constraints and a moderate ( 102) number of variables. Such linear programs occur in data mining and machine learning.
O. L. Mangasarian, Mangasarian, Olvi
core
A semismooth newton method for the nearest Euclidean distance matrix problem
, 2013 The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter ...
Qi, Houduo
core +1 more source
On the irreducibility of a class of generalized Schur-type polynomials
四川大学学报. 自然科学版, 2023 Schur proved the irreducible of a class of polynomials over Q, which is re-proved by Coleman by using the method of p-adic Newton polygon. In this paper, also by using the tool of p-adic Newton polygon, and applying the local-global principle, we prove ...
YIN Xuan-Rui, WU Rong-Jun, ZHU Guang-Yan
doaj
Arthritis Care &Research, EarlyView.Objective Obesity, defined by body mass index (BMI) ≥30 kg/m2, is a risk factor for functional limitations in people with knee osteoarthritis (OA). However, function varies among such individuals. Our objective was to evaluate the implications of obesity subtypes on longitudinal patterns of physical functioning in people with or at risk for knee OA ...
Kristine Godziuk +7 more
wiley +1 more source
Quasi-likelihood functions, generalized linear models, and the Gauss-Newton method
, 1974 To define a likelihood we have to specify the form of distribution of the observations, but to define a quasi-likelihood function we need only specify a relation between the mean and variance of the observations and the quasi-likelihood can then be used ...
Wedderburn, R. W. M.
core +1 more source