Are linear algorithms always good for linear problems?

H. Wozniakowski; Arthur G. Werschulz

Aequationes mathematicae (1986)

  • Volume: 31, page 202-212
  • ISSN: 0001-9054; 1420-8903/e

How to cite

top

Wozniakowski, H., and Werschulz, Arthur G.. "Are linear algorithms always good for linear problems?." Aequationes mathematicae 31 (1986): 202-212. <http://eudml.org/doc/137159>.

@article{Wozniakowski1986,
author = {Wozniakowski, H., Werschulz, Arthur G.},
journal = {Aequationes mathematicae},
keywords = {complexity; information operator; Laplace transform inversion; linear optimal error algorithms; mildly nonlinear algorithm},
pages = {202-212},
title = {Are linear algorithms always good for linear problems?},
url = {http://eudml.org/doc/137159},
volume = {31},
year = {1986},
}

TY - JOUR
AU - Wozniakowski, H.
AU - Werschulz, Arthur G.
TI - Are linear algorithms always good for linear problems?
JO - Aequationes mathematicae
PY - 1986
VL - 31
SP - 202
EP - 212
KW - complexity; information operator; Laplace transform inversion; linear optimal error algorithms; mildly nonlinear algorithm
UR - http://eudml.org/doc/137159
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.