Results 171 to 180 of about 349 (256)
Bounds for Coding Theory over Rings. [PDF]
Gassner N +3 more
europepmc +1 more source
Hölder Regularity of the Solutions of Fredholm Integral Equations on Upper Ahlfors Regular Sets
ABSTRACT We extend to the context of metric measured spaces, with a measure that satisfies upper Ahlfors growth conditions, the validity of (generalized) Hölder continuity results for the solution of a Fredholm integral equation of the second kind. Here we note that upper Ahlfors growth conditions include also cases of nondoubling measures.
Massimo Lanza de Cristoforis +1 more
wiley +1 more source
Congruence modules in higher codimension and zeta lines in Galois cohomology. [PDF]
Iyengar SB +3 more
europepmc +1 more source
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
ABSTRACT We address the problem of recovering highly oscillatory operators, represented as n×n$$ n\times n $$ matrices with a fixed set of observed entries. Given that these matrices can be well compressed by butterfly matrix decomposition of L=𝒪(logn) levels requiring only O(nlogn)$$ O\left(n\log n\right) $$ degrees of freedom, we propose a novel ...
Navjot Singh +3 more
wiley +1 more source
Highest-Weight Vectors and Three-Point Functions in GKO Coset Decomposition. [PDF]
Bershtein M, Feigin B, Trufanov A.
europepmc +1 more source
Bidiagonal Decompositions and High‐Accuracy Computations for Newton Collocation Matrices
ABSTRACT We consider a class of collocation matrices A$$ A $$ associated with the Newton basis of the space of polynomials of degree at most n$$ n $$, evaluated at a set of l+1≥n+1$$ l+1\ge n+1 $$ nodes. In the most general setting, we allow n$$ n $$ of these nodes to either coincide with or differ from those defining the Newton basis.
E. Mainar, A. Marco, B. Rubio, R. Viaña
wiley +1 more source
Randomized Algorithms for Streaming Low‐Rank Approximation in Tree Tensor Network Format
ABSTRACT In this work, we present the tree tensor network Nyström (TTNN), an algorithm that extends recent research on streamable tensor approximation, such as for Tucker and tensor‐train formats, to the more general tree tensor network format, enabling a unified treatment of various existing methods.
Alberto Bucci, Gianfranco Verzella
wiley +1 more source
Richard V. Kadison (1925-2018). [PDF]
Rieffel MA.
europepmc +1 more source
ABSTRACT We derive eigenvalue bounds for symmetric block‐tridiagonal multiple saddle‐point systems preconditioned with block‐diagonal Schur complement matrices. This analysis applies to an arbitrary number of blocks and accounts for the case where the Schur complements are approximated, generalizing the findings in [11, Bergamaschi et al., Linear ...
Marco Pilotto +2 more
wiley +1 more source
Abstract This systematic review analyses 32 studies published between 2013 and 2024 on the Mathematics Teacher's Specialised Knowledge (MTSK) model, with the aim of understanding its theoretical development, practical applications and contributions to teacher education in secondary and pre‐university contexts.
Daniel Martín‐Cudero
wiley +1 more source

