Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Mixed settings for linear problems

  • G. W. Wasilkowski
  • , H. Woźniakowski

Producción científica: Articlerevisión exhaustiva

1 Cita (Scopus)

Resumen

We study the complexity of linear problems in mixed settings. We prove that the complexity of a mixed setting depends primarily on how the algorithm error is defined. That is, the worst error-average cost and worst error-worst cost complexities are essentially the same, as are the average error-worst cost and average error-average cost complexities.

Idioma originalEnglish
Páginas (desde-hasta)457-465
Número de páginas9
PublicaciónJournal of Complexity
Volumen5
N.º4
DOI
EstadoPublished - dic 1989

Nota bibliográfica

Funding Information:
* Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.

Financiación

* Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.

FinanciadoresNúmero del financiador
National Science Foundation Arctic Social Science ProgramICT-85-17289, CCR-86 03674, 8517289

    ASJC Scopus subject areas

    • Algebra and Number Theory
    • Statistics and Probability
    • Numerical Analysis
    • General Mathematics
    • Control and Optimization
    • Applied Mathematics

    Huella

    Profundice en los temas de investigación de 'Mixed settings for linear problems'. En conjunto forman una huella única.

    Citar esto