Academy of Sciences of the Czech Republic

Displaying 1-2 of 2 results

  • White Papers // Sep 2008

    Towards an Advanced Distributed Computing

    In recent years grids and peer-to-peer networks have gained popularity as favourable platforms for the next generation of parallel and distributed computing. Although grid computing was conceived in re-search organizations to support initially compute-intensive scientific applications, enterprises of all types are beginning to recognize this technology as a foundation for...

    Provided By Academy of Sciences of the Czech Republic

  • White Papers // Jun 2008

    On Orthogonal Reduction to Hessenberg Form With Small Bandwidth

    Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. One of the most useful types of such reduction is the orthogonal reduction to (upper) Hessenberg form. This reduction can be computed by the Arnoldi algorithm. When A is...

    Provided By Academy of Sciences of the Czech Republic

  • White Papers // Jun 2008

    On Orthogonal Reduction to Hessenberg Form With Small Bandwidth

    Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. One of the most useful types of such reduction is the orthogonal reduction to (upper) Hessenberg form. This reduction can be computed by the Arnoldi algorithm. When A is...

    Provided By Academy of Sciences of the Czech Republic

  • White Papers // Sep 2008

    Towards an Advanced Distributed Computing

    In recent years grids and peer-to-peer networks have gained popularity as favourable platforms for the next generation of parallel and distributed computing. Although grid computing was conceived in re-search organizations to support initially compute-intensive scientific applications, enterprises of all types are beginning to recognize this technology as a foundation for...

    Provided By Academy of Sciences of the Czech Republic