Computational aspects of jacobian matrices
This paper is a survey on some aspects of the importance of jacobian ideals, and varieties. In particular the author shows how one can effective compute the secant varieties. The most important definitions and concepts are given, in order to recall them to the audience (this is the text which was used in the talk given at a conference). In section 3 there is an exposition on the case of the so called correspondences. As it is defined this corresponds to ideals \(I\) of bigrade \((1, 1)\), in \(k[X,T]=k[X_1\cdots,X_d;T_1,\cdots T_n]\). Various important results for this particular case are stated and explained, and the effectiveness of the calculations are explained. The last section describes an effective and reasonably fast (according to the author) method to compute the symbolic powers of an ideal in an iterative way. Nevertheless some theoretical results are obtained as a byproduct. After reading the paper the reader feels that he should he should have been in the talk. For the entire collection see [Zbl 0857.00037].
- On computing Jacobi matrices associated with recurrent and Möbius iterated function systems
- Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes
- scientific article; zbMATH DE number 66967 (Why is no real title available?)
- scientific article; zbMATH DE number 140023 (Why is no real title available?)
- scientific article; zbMATH DE number 177860 (Why is no real title available?)
- Effective computation of symbolic powers by jacobian matrices
This page was built for publication: Computational aspects of jacobian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336118)
