Results 31 to 40 of about 45,837 (216)
Chebyshev sets in geodesic spaces
Journal of Approximation Theory, 2016 A subset \(C\) of a metric space \((X,d)\) is a Chebyshev set if each point in \(X\) has a unique closest point in \(C\). With the added structure for \((X,d)\) being a normed linear space questions involving the convexity of \(C\) become central (as well as questions about the smoothness of the unit ball of \(X\)).
Ariza-Ruiz, David +3 more
openaire +2 more sources
Adjoining a Constant Function to n-Dimensional Chebyshev Space
Journal of Function Spaces, 2016 This paper is concerned with extending a Chebyshev system of n continuous nonconstant functions into a set of n+1 functions including a constant function. Necessary and sufficient conditions for the new set to be a Chebyshev system are discussed and some
Mansour Alyazidi-Asiry
doaj +1 more source
Finite Dimensional Chebyshev Subspaces of Lo
Sultan Qaboos University Journal for Science, 2017 If A is a subset of the normed linear space X, then A is said to be proximinal in X if for each xÎX there is a point y0ÎA such that the distance between x and A; d(x, A) = inf{||x-y||: yÎA}= ||x-y0||.
Aref K. Kamal
doaj +1 more source
An efficient algorithm for solving the conformable time-space fractional telegraph equations
Moroccan Journal of Pure and Applied Analysis, 2021 In this paper, an efficient algorithm is proposed for solving one dimensional time-space-fractional telegraph equations. The fractional derivatives are described in the conformable sense.
Saad Abdelkebir, Brahim Nouiri
doaj +1 more source
On the generalized Approximate Weak Chebyshev Greedy Algorithm
, 2016 In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely.
Dereventsov, Anton
core +1 more source
New Modified Method of the Chebyshev Collocation Method for Solving Fractional Diffusion Equation
International Journal of Analysis and Applications, 2018 In this article a modification of the Chebyshev collocation method is applied to the solution of space fractional differential equations. The fractional derivative is considered in the Caputo sense.
H. Jaleb, H. Adibi
doaj +2 more sources
Examples of Chebyshev Sets in Matrix Spaces
Journal of Approximation Theory, 1999 Let A be a quadratic matrix of order \(n\) with complex elements (we denote this by \(A\in \mathbb{C}^{n\times n}\)) and \(U\Sigma V^{\ast }\) \(the\) singular value decomposition of \(A,\) where \(U,\) \(V\) are unitary matrices, \(\Sigma =\text{diag}( \sigma _{1}( A),\sigma _{2}( A) ,\dots,\sigma _{n}( A)) \) and \(\sigma _{1}( A) \geq \sigma _{2}( A)
Alimov, A.R, Berens, H
openaire +1 more source
Parallel Self-Consistent-Field Calculations via Chebyshev-Filtered Subspace Acceleration [PDF]
, 2006 Solving the Kohn-Sham eigenvalue problem constitutes the most computationally expensive part in self-consistent density functional theory (DFT) calculations.
B. Fornberg +10 more
core +1 more source
Bottom‐Up Programming of Cell States in Cancer Organoids with Defined Synthetic Adhesion Cues
Advanced Materials, EarlyView.A bottom‐up biomaterial platform is developed to program transcriptomic states in pancreatic cancer organoids by tuning adhesion cues within synthetic matrices. By combining a Design of Experiments framework with multiobjective optimization, matrix compositions are identified that enrich specific cellular programs like EMT.
Ali Nadernezhad +6 more
wiley +1 more source
Advanced Science, EarlyView.We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich +2 more
wiley +1 more source