Algorithms for the theory of restrictions of scalar -D systems to proper subspaces of R-n
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
Algorithms for the theory of restrictions of scalar -D systems to proper subspaces of R-n
|
|
Creator |
PAL, D
PILLAI, HK |
|
Subject |
FINITE-DIMENSIONAL BEHAVIORS
LINEAR-SYSTEMS CONSTANT-COEFFICIENTS PARTIAL DIFFERENCE EQUATIONS STABILITY Systems of PDEs Restriction ideals Computational algorithms |
|
Description |
In this paper, we study the restrictions of solutions of a scalar system of PDEs to a proper subspace of the domain . The object of study is associated with certain intersection ideals. In the paper, we provide explicit algorithms to calculate these intersection ideals. We next deal with when a given subspace is "free" with respect to the solution set of a system of PDEs-this notion of freeness is related to restrictions and intersection ideals. We again provide algorithms and checkable algebraic criterion to answer the question of freeness of a subspace. Finally, we provide an upper bound to the dimension of free subspaces that can be associated with the solution set of a system of PDEs.
|
|
Publisher |
SPRINGER
|
|
Date |
2016-01-14T12:13:54Z
2016-01-14T12:13:54Z 2015 |
|
Type |
Article
|
|
Identifier |
MULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSING, 26(2SI)439-457
0923-6082 1573-0824 http://dx.doi.org/10.1007/s11045-014-0285-4 http://dspace.library.iitb.ac.in/jspui/handle/100/17469 |
|
Language |
en
|
|