Results 41 to 50 of about 183 (122)
An improved method for inhomogeneous space grid in the simulation of unsaturated flow
The Richards’ equation is widely used in the simulation of unsaturated flow and related fields. In the numerical solution process, the finite difference method can be used to carry out numerical discretization and iterative calculation. However, in order
Shuairun ZHU +4 more
doaj +1 more source
A comparative large‐amplitude oscillatory shear analysis reveals how cationic surfactants progressively weaken xanthan gum networks. While conventional rheology identifies network softening, advanced LAOS methods uncover nonlinear deformation mechanisms and transient structural evolution that remain hidden in cycle‐averaged measurements.
Osita Sunday Nnyigide +2 more
wiley +1 more source
On Rational Interpolation to |x| at the Adjusted Chebyshev Nodes
The adjusted Chebyshev nodes on the interval \([0,1]\) are defined to be \[ \sin^2((2k-1)\pi/ 4n),\quad k= 1,2,\dots, n. \] Using that \(| x|\) is an even function, the study of its rational approximation on the interval \([-1,1]\) can be reduced to \([0,1]\).
openaire +1 more source
One of the simplest schemes of the degenerate matrix method with nodes as zeroes of Chebyshev polynomials of the second kind is considered. Performance of simple iterations and some modifications of Newton method for the discrete problem is compared ...
T. Cirulis, O. Lietuvietis
doaj +1 more source
Exploration of new wildlife surveying methodologies that leverage advances in sensor technology and machine learning has led to tentative research into the application of seismology techniques. This, most commonly, involves the deployment of a footfall trap – a seismic sensor and data logger customised for wildlife footfall.
Benjamin J. Blackledge +4 more
wiley +1 more source
Alternating polynomials associated with the Chebyshev extrema nodes
For a given set \(X=\{x_ k\}_ 0^{n+1}\) of nodes in [-1,1], the author introduces an operator \(A_ n(X;x)\) mapping functions in C[-1,1] into polynomials of degree n. They were called `generalized alternating polynomials'. Here X is specialized to \(U=\{\cos k\pi /n+1\}_ 0^{n+1}\), the extrema of Chebyshev polynomials of the first kind.
openaire +2 more sources
In this paper we formulate necessary conditions for the stability of certain quadrature methods for Mellin type singular integral equations on an interval.
Peter Junghanns, Robert Kaiser
doaj +1 more source
Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source
ANPGT: Towards Adaptive Node Property Extraction and Integration
ABSTRACT Graph transformers (GTs) with elaborate positional/structural encodings (PEs/SEs) have excelled in graph representation learning, especially in graph‐level tasks. However, their potential in large‐scale node classification remains untapped for several reasons: (i) Current PEs/SEs are insufficient in modelling large‐scale real‐world graphs ...
Qin Chen +4 more
wiley +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid +4 more
wiley +1 more source

