Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1022 9 |
Ultima descărcare din IBN: 2023-12-15 04:37 |
Căutarea după subiecte similare conform CZU |
004.852:519.654 (1) |
Inteligență artificială (296) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
SM ISO690:2012 SALAHI, Maziar, ZAREAMOGHADDAM, Hossein. Computational Experiments on the Tikhonov
Regularization of the Total Least Squares
Problem. In: Computer Science Journal of Moldova, 2009, nr. 1(49), pp. 14-25. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |||||
Numărul 1(49) / 2009 / ISSN 1561-4042 /ISSNe 2587-4330 | |||||
|
|||||
CZU: 004.852:519.654 | |||||
Pag. 14-25 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
In this paper we consider finding meaningful solutions of illconditioned overdetermined linear systems Ax ¼ b; where A and
b are both contaminated by noise. This kind of problems frequently arise in discretization of certain integral equations. One
of the most popular approaches to ¯nd meaningful solutions of
such systems is the so called total least squares problem. First we
introduce this approach and then present three numerical algorithms to solve the resulting fractional minimization problem. In
spite of the fact that the fractional minimization problem is not
necessarily a convex problem, on all test problems we can get the
global optimal solution. Extensive numerical experiments are reported to demonstrate the practical performance of the presented
algorithms. |
|||||
Cuvinte-cheie Linear systems, Total least squares, Tikhonov regularization, Newton method, Bisection method |
|||||
|