Results 51 to 60 of about 45,837 (216)
Certain Chebyshev Type Integral Inequalities Involving Hadamard’s Fractional Operators
Abstract and Applied Analysis, 2014 We establish certain new fractional integral inequalities for the differentiable functions whose derivatives belong to the space Lp([1,∞)), related to the weighted version of the Chebyshev functional, involving Hadamard’s fractional integral operators ...
Sotiris K. Ntouyas +2 more
doaj +1 more source
Data‐Driven High‐Throughput Volume Fraction Estimation From X‐Ray Diffraction Patterns
Advanced Intelligent Discovery, EarlyView.Long exposure times and the need for manual evaluation limit the use of X‐ray diffraction in high‐throughput applications. This study presents a data‐driven approach addressing both issues. HiVE (a method for High‐throughput Volume fraction Estimation) performs composition estimation for high‐noise XRD patterns produced using polychromatic emission ...
Hawo H. Höfer +6 more
wiley +1 more source
A characterization of Chebyshev spaces
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1986 Let C[a,b] be the space of all real-valued continuous functions on the finite closed interval [a,b] and M a given n-dimensional linear subspace of C[a,b]. For this subspace M, we put the following two subsets of C[a,b]: \(S_ M=\{f| f\) possesses a unique best minimax approximation from \(M\}\), \(A_ M=\{g|\) the error function \(e=g-\tilde g\) has an ...
openaire +3 more sources
The “paradoxical” mechanism of P. L. Chebyshev [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. ИнформатикаThe kinematics and dynamics of P. L. Chebyshev's “paradoxical” mechanism are considered. The point of interest in the dynamics of the “paradoxical” mechanism is connected with the fact that its configuration space ...
Burian, Sergey N.
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.We propose a residual‐based adversarial‐gradient moving sample (RAMS) method for scientific machine learning that treats samples as trainable variables and updates them to maximize the physics residual, thereby effectively concentrating samples in inadequately learned regions.
Weihang Ouyang +4 more
wiley +1 more source
SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
Forum of Mathematics, Sigma, 2014 We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the weak Chebyshev greedy algorithm (WCGA), a generalization of the weak orthogonal matching pursuit to the case of a Banach space.
V. N. TEMLYAKOV
doaj +1 more source
An improved method for inhomogeneous space grid in the simulation of unsaturated flow
Shuiwen dizhi gongcheng dizhi, 2023 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
Stochastic collocation on unstructured multivariate meshes
, 2015 Collocation has become a standard tool for approximation of parameterized systems in the uncertainty quantification (UQ) community. Techniques for least-squares regularization, compressive sampling recovery, and interpolatory reconstruction are becoming ...
Narayan, Akil, Zhou, Tao
core +1 more source
Optimizing 3D Bin Packing of Heterogeneous Objects Using Continuous Transformations in SE(3)
Advanced Intelligent Systems, EarlyView.This article presents a method for solving the three‐dimensional bin packing problem for heterogeneous objects using continuous rigid‐body transformations in SE(3). A heuristic optimization framework combines signed‐distance functions, neural network approximations, point‐cloud bin modeling, and physics simulation to ensure feasibility and stability ...
Michele Angelini, Marco Carricato
wiley +1 more source
Relative Chebyshev centers in normed linear spaces, I
Journal of Approximation Theory, 1980 AbstractLet E be a normed linear space, A a bounded set in E, and G an arbitrary set in E. The relative Chebyshev center of A in G is the set of points in G best approximating A. We have obtained elsewhere general results characterizing the spaces in which the center reduces to a singleton in terms of structural properties related to uniform and strict
Amir, Dan, Ziegler, Zvi
openaire +2 more sources