Results 131 to 140 of about 21,657 (246)
Journal of Applied Sciences and Environmental Management, 2006 In this paper, we proved the superiority of Legendre polynomial to Chebyshev polynomial in solving first order ordinary differential equation with rational coefficient.
FO Akinpelu, LA Adetunde, EO Omidiora
doaj +1 more source
A Sub‐Microsecond Switch Enabling SWIFT 23Na Imaging at 10.5 T
Magnetic Resonance in Medicine, Volume 96, Issue 4, Page 1991-2003, October 2026.ABSTRACT PurposeTo enable sodium SWIFT imaging, which is a zero‐echo time imaging technique, at ultra‐high magnetic fields through the development of custom electronics hardware, and to showcase this capability with in vivo imaging results. MethodsThe custom hardware developed consists of a high‐speed optical trigger with 10 ns resolution, an in‐bore ...
Russell L. Lagore +10 more
wiley +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1831-1918, August 2026.ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Interpolation by Weak Chebyshev Spaces [PDF]
, 2000 We present two characterizations of Lagrange interpolation sets for weak Chebyshev spaces. The first of them is valid for an arbitrary weak Chebyshev space U and is based on an analysis of the structure of zero sets of functions in U extending ...
Davydov, Oleg, Sommer, Manfred
core +1 more source
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.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
Diffusion Approximation to Neutron Transport Equation with First Kind of Chebyshev Polynomials
Süleyman Demirel Üniversitesi Fen-Edebiyat Fakültesi Fen Dergisi, 2015 : The first kind of Chebyshev polynomials are used for the series expansion of the neutron angular flux in neutron transport theory. The first order approximation known as the diffusion approximation is applied to one-dimensional neutron transport ...
Ökkeş EGE +2 more
doaj
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.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
On Chebyshev's inequality for sequences
Discrete Mathematics, 1996 Various results in connection to the well-known Chebyshev's inequality are given. For example, the following result is valid: If the sequences \(a\) and \(b\) are star-shaped then, for \(n>1\), we have the inequality \[ \sum^n_{i= 1}a_i \sum^n_{i= 1}b_i\leq {9\over 10} n \sum^n_{i= 1} a_ib_i.
openaire +2 more sources
Random Structures &Algorithms, Volume 69, Issue 1, August 2026.ABSTRACT We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski (2004). Vertices are attached sequentially, one by one, by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random.
Louigi Addario‐Berry +5 more
wiley +1 more source
Miners' Reward Elasticity and Stability of Competing Proof‐of‐Work Cryptocurrencies
International Economic Review, Volume 67, Issue 3, Page 957-976, August 2026.ABSTRACT Proof‐of‐Work cryptocurrencies employ miners to sustain the system through algorithmic reward adjustments. We develop a stochastic model of the multicurrency mining and identify conditions for stable transaction speeds. Bitcoin's algorithm requires hash supply elasticity <$<$1 for stability, while ASERT remains stable for any elasticity and ...
Kohei Kawaguchi +2 more
wiley +1 more source