Listing 1 - 3 of 3 |
Sort by
|
Choose an application
Provides the user with a step-by-step introduction to Fortran 77, BLAS, LINPACK, and MATLAB. It is a reference that spans several levels of practical matrix computations with a strong emphasis on examples and & hands on' experience.
Algebra --- Programming --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- 681.3*G4 Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Matrices --- #TELE:SISTA --- 519.61 --- 681.3*G13 --- 681.3*G4 --- 519.61 Numerical methods of algebra --- Numerical methods of algebra --- Data processing --- Data processing. --- Informatique --- Matrices - Data processing. --- Calcul matriciel --- Methodes numeriques
Choose an application
cryptografie --- cryptologie --- Computer. Automation --- Computers --- Cryptography --- Ordinateurs --- Cryptographie --- Access control --- Congresses --- Accès --- Contrôle --- Congrès --- 681.3*H2 --- 681.3*D46 --- 681.3*E3 --- 681.3*F13 --- 681.3*F21 --- Database management: security; integrity; protection--See also {?681.5*E5} --- Security and protection: access controls; authentication; cryptographic controls; information flow controls; security kernels; verification (Operating systems) --- Data encryption: data encryption standard; DES; public key cryptosystems --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- 681.3*F21 Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*E3 Data encryption: data encryption standard; DES; public key cryptosystems --- 681.3*D46 Security and protection: access controls; authentication; cryptographic controls; information flow controls; security kernels; verification (Operating systems) --- 681.3*H2 Database management: security; integrity; protection--See also {?681.5*E5} --- Accès --- Contrôle --- Congrès --- Computers.
Choose an application
This book contains a selection of papers presented at a Symposium on coding theory: "3 Journées sur le Codage", held November 24-26, 1986, in Cachan near Paris, France. It gives an account of the state of the art of research in France on Coding, ranging from rather theoretical topics like algebraic geometry and combinatorial coding to applications like modulation, real-space decoding and implementation of coding algorithms on microcomputers. The symposium was the second one of this type. With its broad spectrum, it was a unique opportunity for contacts between university and industry on the topics of information and coding theory.
681.3*E4 --- 681.3*G21 --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 681.3*G21 Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 681.3*F21 Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- Information systems --- Discrete mathematics --- 681.3*F21 --- Coding theory --- Congresses. --- Coding theory. --- Information theory. --- Coding and Information Theory. --- Discrete Mathematics. --- Theory of Computation. --- Communication theory --- Communication --- Cybernetics --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming
Listing 1 - 3 of 3 |
Sort by
|