The bounded case of the weighted approximation problem

1974 ◽  
pp. 177-183 ◽  
Author(s):  
W. H. Summers
Keyword(s):  
Weighted Approximation ◽  
Approximation Problem

The general complex bounded case of the strict weighted approximation problem

1971 ◽  
Vol 192 (2) ◽  
pp. 90-98 ◽  
Author(s):  
W. H. Summers
Keyword(s):  
Weighted Approximation ◽  
Approximation Problem ◽  
General Complex

New solution for the ideal filter approximation problem

1983 ◽  
Vol 130 (4) ◽  
pp. 161
Author(s):  
vančo B. Litovski ◽  
Dragiša P. Milovanovi
Keyword(s):  
Approximation Problem ◽  
Filter Approximation ◽  
Ideal Filter ◽  
The Ideal

Approximation problem during calculation of pneumatic brake drive by integral method

2020 ◽  
pp. 33-38
Author(s):  
M. P. Malinovsky ◽  
◽  
E. S. Smolko ◽  
Keyword(s):  
Integral Method ◽  
Approximation Problem

scholarly journals The core inverse and constrained matrix approximation problem

2020 ◽  
Vol 18 (1) ◽  
pp. 653-661 ◽  
Author(s):  
Hongxing Wang ◽  
Xiaoyan Zhang
Keyword(s):  
Unique Solution ◽  
Approximation Problem ◽  
Frobenius Norm ◽  
Matrix Approximation ◽  
The Core ◽  
Core Inverse

Abstract In this article, we study the constrained matrix approximation problem in the Frobenius norm by using the core inverse: ||Mx-b|{|}_{F}=\hspace{.25em}\min \hspace{1em}\text{subject}\hspace{.25em}\text{to}\hspace{1em}x\in {\mathcal R} (M), where M\in {{\mathbb{C}}}_{n}^{\text{CM}} . We get the unique solution to the problem, provide two Cramer’s rules for the unique solution and establish two new expressions for the core inverse.

scholarly journals An explicit solution of an L1 approximation problem

1985 ◽  
Vol 44 (2) ◽  
pp. 194-195
Author(s):  
D Kershaw
Keyword(s):  
Explicit Solution ◽  
Approximation Problem ◽  
L1 Approximation

Algorithm for Spatial Straightness Evaluation Using Theories of Linear Complex Chebyshev Approximation and Semi-infinite Linear Programming

2005 ◽  
Vol 128 (1) ◽  
pp. 167-174 ◽  
Author(s):  
LiMin Zhu ◽  
Ye Ding ◽  
Han Ding
Keyword(s):  
Linear Programming ◽  
Chebyshev Approximation ◽  
Approximation Problem ◽  
Linear Complex ◽  
Infinite Linear Programming ◽  
Minimum Zone ◽  
Effectiveness And Efficiency ◽  
Primal And Dual ◽  
Straightness Error ◽  
Infinite Linear

This paper presents a novel methodology for evaluating spatial straightness error based on the minimum zone criterion. Spatial straightness evaluation is formulated as a linear complex Chebyshev approximation problem, and then reformulated as a semi-infinite linear programming problem. Both models for the primal and dual programs are developed. An efficient simplex-based algorithm is employed to solve the dual linear program to yield the straightness value. Also a general algebraic criterion for checking the optimality of the solution is proposed. Numerical experiments are given to verify the effectiveness and efficiency of the presented algorithm.

An approximation problem in inverse scattering theory

1991 ◽  
Vol 41 (1-4) ◽  
pp. 23-32 ◽  
Author(s):  
David Colton ◽  
Andreas Kirsch
Keyword(s):  
Inverse Scattering ◽  
Scattering Theory ◽  
Approximation Problem ◽  
Inverse Scattering Theory
Sign in / Sign up

Export Citation Format

Share Document