Results 191 to 200 of about 45,618 (222)
Some of the next articles are maybe not open access.

Chebyshev systems and estimation theory for discrete distributions

Statistics & Probability Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braverman, Mark, Lumelskii, Yan
openaire   +1 more source

Algorithm 414: Chebyshev approximation of continuous functions by a Chebyshev system of functions

Communications of the ACM, 1971
The second algorithm of Remez can be used to compute the minimax approximation to a function, ƒ( x ), by a linear combination of functions, { Q i ( x )} n 0 ...
G. H. Golub, L. B. Smith
openaire   +1 more source

Some criteria and properties of Chebyshev systems

Siberian Mathematical Journal, 1995
Let \(T^n [a, b]\) be the Chebyshev system of \(n\) functions on \([a, b]\). An isolated zero \(t\in [a, b]\) of a continuous function \(x\) is called nodal if either \(t\in \{a, b\}\) or \(t\in ]a, b[\) and the function \(x\) changes sign upon passage across \(t\), and \(t\) is nonnodal otherwise.
Rasa, I., Labsker, L. G.
openaire   +2 more sources

Pseudospectral Chebyshev Optimal Control of Constrained Nonlinear Dynamical Systems

Computational Optimization and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elnagar, Gamal N., Kazemi, Mohammad A.
openaire   +2 more sources

Least Squares and Chebyshev Systems

2012
As readers know, polynomials of degree n, in other words linear combinations of n + 1 monomials 1,…, t n , may have at most n real zeros. A far-reaching generalization of this fact raises a fundamental concept of Chebyshev systems, briefly, T-systems. Those systems are defined as follows.
openaire   +1 more source

Chebyshev systems of locally analytic functions

Mathematical Notes, 1994
Let \(\{f_1 (q), \dots, f_n(q)\}\) be a linearly independent system of continuous functions on any compact set \(Q\). The author introduces the notion of locally analytic functions and considers a ``polynomial'' \(P_\alpha (z)= \alpha_1 f_1 (z)+\dots +\alpha_n f_n (z)\), \(\alpha= (\alpha_1, \dots, \alpha_n)\in \mathbb{C}^n\). He describes the set \(Q\)
openaire   +1 more source

A splitting Chebyshev collocation method for Schrödinger–Poisson system

Computational and Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanquan Wang, Zhenguo Liang, Ronghua Liu
openaire   +2 more sources

Solution of a Scaled System via Chebyshev Polynomials

Journal of the Franklin Institute, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Chebyshev based continuous time power system operation approach

2015 IEEE Power & Energy Society General Meeting, 2015
There is a growing interest to increase temporal resolution in power system optimization models in order to improve representation of intermittent renewable generation and thus capture more variability and costs. This increase in temporal resolution, however, presents important modeling challenges since the optimization problem complexity grows with ...
Marcelo Matus   +3 more
openaire   +1 more source

Chebyshev Polynomial Broad Learning System

2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS), 2021
Shuang Feng   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy