Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    An algorithm for best approximate solutions ofAx=b with a smooth strictly convex norm (1977)
    Springer
    Numerische Mathematik 29 (1977), S. 83-91 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; 41A50 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper, overdetermined systems ofm linear equations inn unknowns are considered. Withℝ m equipped with a smooth strictly convex norm, ‖·‖, an iterative algorithm for finding the best approximate solution of the linear system which minimizes the ‖·‖-error is given. The convergence of the algorithm is established and numerical results are presented for the case when ‖·‖ is anl p norm, 1〈p〈∞.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01389315
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...