Christian Bischof mostly deals with Algorithm, Automatic differentiation, QR decomposition, Parallel computing and Factorization. His Algorithm study also includes fields such as
His work focuses on many connections between QR decomposition and other disciplines, such as Rank, that overlap with his field of interest in Applied mathematics and Mathematical optimization. The Parallel computing study combines topics in areas such as Basic Linear Algebra Subprograms, Visualization, Feature extraction, Eigenvalues and eigenvectors and Virtual reality. Christian Bischof interconnects Representation, Matrix multiplication, Householder's method, Householder transformation and Multiplication in the investigation of issues within Factorization.
His primary scientific interests are in Automatic differentiation, Parallel computing, Algorithm, Fortran and Computation. His Automatic differentiation study is associated with Programming language. His Parallel computing study incorporates themes from Lattice problem and Scalability.
His work deals with themes such as Function, Matrix, QR decomposition and Chain rule, which intersect with Algorithm. His study looks at the relationship between Chain rule and fields such as Differential calculus, as well as how they intersect with chemical problems. His Fortran research includes themes of Numerical differentiation and Numerical analysis.
Christian Bischof mainly investigates Parallel computing, Lattice problem, Cryptography, Automatic differentiation and Solver. His Parallel computing study integrates concerns from other disciplines, such as Scalability, Compiler, Computer architecture, Code and Data structure. His Lattice problem study also includes
His Cryptography research is multidisciplinary, relying on both Computational complexity theory and Simulated annealing. His Operator overloading study in the realm of Automatic differentiation interacts with subjects such as Source transformation. His Solver research includes elements of Core and Speedup.
His primary areas of investigation include Parallel computing, Lattice problem, Cryptography, Theoretical computer science and Cryptosystem. His Parallel computing research incorporates elements of Scalability, Compiler and Implementation. His biological study deals with issues like Solver, which deal with fields such as Performance engineering, Task, Automation, Supercomputer and Learning with errors.
His study in Theoretical computer science is interdisciplinary in nature, drawing from both Programming language, Source code, Operator overloading, Unreachable code and Code bloat. He usually deals with Code bloat and limits it to topics linked to Source lines of code and Automatic differentiation. His Algorithm study combines topics in areas such as Heuristics and Prime.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
ADIFOR-Generating Derivative Codes from Fortran Programs
Christian Bischof;Alan Carle;George Corliss;Andreas Griewank.
Scientific Programming (1992)
Adifor 2.0: automatic differentiation of Fortran 77 programs
C. Bischof;P. Khademi;A. Mauer;A. Carle.
computational science and engineering (1996)
LAPACK: a portable linear algebra library for high-performance computers
E. Anderson;Z. Bai;J. Dongarra;A. Greenbaum.
conference on high performance computing (supercomputing) (1990)
LAPACK Users' Guide, 3rd ed.
Ed Anderson;Zhaojun Bai;Christian Bischof;Susan Blackford.
Philadelphia: Society for Industrial and Applied Mathematics (1999)
The WY representation for products of householder matrices
Christian Bischof;Charles van Loan.
Siam Journal on Scientific and Statistical Computing (1987)
ADIC: an extensible automatic differentiation tool for ANSI-C
C. H. Bischof;L. Roh;A. J. Mauer-Oats.
Software - Practice and Experience (1997)
LAPACK Users' guide (third ed.)
E. Anderson;Z. Bai;C. Bischof;L. S. Blackford.
Computing rank-revealing QR factorizations of dense matrices
Christian H. Bischof;G. Quintana-Ortí.
ACM Transactions on Mathematical Software (1998)
On updating signal subspaces
C.H. Bischof;G.M. Shroff.
IEEE Transactions on Signal Processing (1992)
Incremental condition estimation
Christian H. Bischof.
SIAM Journal on Matrix Analysis and Applications (1990)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: