Results 31 to 40 of about 261,453 (169)
On the acceleration of convergence by regular matrix methods; pp. 3–17 [PDF]
Regular matrix methods that improve and accelerate the convergence of sequences and series are studied. Some problems related to the speed of convergence of sequences and series with respect to matrix methods are discussed.
Ants Aasma
doaj +1 more source
King[3] introduced and examined the concepts of almost A-summable sequence, almost conservative matrix and almost regular matrix By following King, in this paper we introduce and examine the concepts of θ-almost A-summable sequence, θ-almost conservative
Fatih Nuray
doaj +1 more source
Matrix Regularization for Gauge Theories
Abstract We consider how gauge theories can be described by matrix models. Conventional matrix regularization is defined for scalar functions and is not applicable to gauge fields, which are connections of fiber bundles. We clarify how the degrees of freedom of gauge fields are related to the matrix degrees of freedom, by formulating the
Hiroyuki Adachi +2 more
openaire +3 more sources
Constructive Regularization of the Random Matrix Norm [PDF]
We show a simple local norm regularization algorithm that works with high probability. Namely, we prove that if the entries of a $n \times n$ matrix $A$ are i.i.d. symmetrically distributed and have finite second moment, it is enough to zero out a small fraction of the rows and columns of $A$ with largest $L_2$ norms in order to bring the operator norm
openaire +2 more sources
On the spectra of reduced distance matrix of dendrimers [PDF]
Let G be a simple connected graph and {v_1,v_2,... , v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is an square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G.
Abbas Heydari
doaj
Matrix Regular Operator Spaces
A norm on an ordered real Banach space \(E\) is called regular (or Riesz norm) if \(-x\leq y\leq x\) implies \(\| y\|\leq\| x\|\), and \(\| y\|< 1\) implies the existence of \(x\in E\) with \(\| x\|< 1\) and \(-x\leq y\leq x\). This concept is generalized to matrix ordered complex operator spaces [as introduced by \textit{M.-D. Choi} and \textit{E.
openaire +1 more source
Implicit Regularization in Deep Matrix Factorization
Efforts to understand the generalization mystery in deep learning have led to the belief that gradient-based optimization induces a form of implicit regularization, a bias towards models of low "complexity." We study the implicit regularization of gradient descent over deep linear neural networks for matrix completion and sensing, a model referred to ...
Sanjeev Arora +3 more
openaire +3 more sources
Variation diminution and intervals of sign regular matrices
A sign regular matrix is a matrix having the property that its non-zero minors of all orders have, for each order, an identical sign. Such matrices arise in a wide range of applications. In this paper, intervals of real matrices with respect to the usual
Mohammad Adm, Jürgen Garloff
doaj +1 more source
Some results of neutrosophic normed space VIA Tribonacci convergent sequence spaces
The concept of Tribonacci sequence spaces by the domain of a regular Tribonacci matrix was introduced by Yaying and Hazarika (Math. Slovaca 70(3):697–706, 2000). In this paper, by using the domain of regular Tribonacci matrix T = ( t i k ) $T = (t _{ik} )
Vakeel A. Khan +2 more
doaj +1 more source
Total Variation Regularization of Matrix‐Valued Images [PDF]
We generalize the total variation restoration model, introduced by Rudin, Osher, and Fatemi in 1992, to matrix‐valued data, in particular, to diffusion tensor images (DTIs). Our model is a natural extension of the color total variation model proposed by Blomgren and Chan in 1998.
Oddvar Christiansen +4 more
openaire +5 more sources

