Ontology type: schema:MonetaryGrant

2011-2015

425000 USD

The solution of symbolic computation problems can be accelerated in at least two ways: one is to integrate limited precision floating point arithmetic on the scalars, and the other is to use parallel processes. We propose to investigate those approaches on problems in real algebraic optimization and exact linear algebra. Semidefinite numerical optimization produces sum-of-squares representations for polynomial inequalities, which express global optimality. But the representations are numeric and approximate, and exact rational certificates for the inequalities are derived via exact symbolic means, thus leading to truly hybrid symbolic-numeric algorithms. When combining floating point arithmetic and randomization, analysis of the expected condition numbers of the random intermediate problems can guarantee success. We propose to introduce fraction-free algorithms and analyze the arising determinantal condition numbers. LinBox is a C++ library for exact linear algebra. We propose to participate in the parallelization of the LinBox library by investigating problems with memory contention and by creating interactive symbolic supercomputing environments. Several related problems in computational algebraic complexity that will receive attention are: quadratic-time certificates for linear algebra problems, determinantal representation of polynomials by symmetric linear matrix forms, and interpolation of supersparse (lacunary) rational functions. The PI's research expands the infrastructure in symbolic computation and the understanding of the underlying complexity. Aside from certifying optima, exact sums-of-squares certificates have proved theorems in mathematics, physics and control theory. Some of the important applications of LinBox are sparse linear algebra over finite fields and integer Smith forms for computational topology data. The PI is making the developed software freely available. Algorithmic thinking and computation have become a cornerstone of modern science (pure and applied) and modern life. Symbolic computation programs, such as Mathematica, Maple, and the SAGE platform, have many applications, such as modeling data sets by symbolic expression for Toyota and Shell Oil, generating programs for signal processing, and program and protocol verification. More... »

http://www.nsf.gov/awardsearch/showAward?AWD_ID=1115772&HistoricalAwards=false

JSON-LD is the **canonical representation** for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

```
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2201",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2208",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"type": "DefinedTerm"
}
],
"amount": {
"currency": "USD",
"type": "MonetaryAmount",
"value": "425000"
},
"description": "The solution of symbolic computation problems can be accelerated in at least two ways: one is to integrate limited precision floating point arithmetic on the scalars, and the other is to use parallel processes. We propose to investigate those approaches on problems in real algebraic optimization and exact linear algebra. Semidefinite numerical optimization produces sum-of-squares representations for polynomial inequalities, which express global optimality. But the representations are numeric and approximate, and exact rational certificates for the inequalities are derived via exact symbolic means, thus leading to truly hybrid symbolic-numeric algorithms. When combining floating point arithmetic and randomization, analysis of the expected condition numbers of the random intermediate problems can guarantee success. We propose to introduce fraction-free algorithms and analyze the arising determinantal condition numbers. LinBox is a C++ library for exact linear algebra. We propose to participate in the parallelization of the LinBox library by investigating problems with memory contention and by creating interactive symbolic supercomputing environments. Several related problems in computational algebraic complexity that will receive attention are: quadratic-time certificates for linear algebra problems, determinantal representation of polynomials by symmetric linear matrix forms, and interpolation of supersparse (lacunary) rational functions. The PI's research expands the infrastructure in symbolic computation and the understanding of the underlying complexity. Aside from certifying optima, exact sums-of-squares certificates have proved theorems in mathematics, physics and control theory. Some of the important applications of LinBox are sparse linear algebra over finite fields and integer Smith forms for computational topology data. The PI is making the developed software freely available. Algorithmic thinking and computation have become a cornerstone of modern science (pure and applied) and modern life. Symbolic computation programs, such as Mathematica, Maple, and the SAGE platform, have many applications, such as modeling data sets by symbolic expression for Toyota and Shell Oil, generating programs for signal processing, and program and protocol verification.",
"endDate": "2015-07-31T00:00:00Z",
"funder": {
"id": "https://www.grid.ac/institutes/grid.457785.c",
"type": "Organization"
},
"id": "sg:grant.3126722",
"identifier": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"3126722"
]
},
{
"name": "nsf_id",
"type": "PropertyValue",
"value": [
"1115772"
]
}
],
"inLanguage": [
"en"
],
"keywords": [
"limited precision",
"Shell Oil",
"SAGE platform",
"exact rational certificates",
"sparse linear algebra",
"parallel processes",
"supersparse",
"fraction-free algorithms",
"rational functions",
"symbolic computation problems",
"computational topology data",
"success",
"condition number",
"global optimality",
"Mathematica",
"Maple",
"many applications",
"mathematics",
"modern science",
"exact symbolic means",
"C++ library",
"sum",
"quadratic-time certificates",
"point arithmetic",
"scalar",
"algorithmic thinking",
"determinantal condition numbers",
"interactive symbolic supercomputing environments",
"integer Smith forms",
"real algebraic optimization",
"problem",
"symbolic-numeric algorithms",
"Pi",
"symbolic computation program",
"signal processing",
"inequality",
"cornerstone",
"representation",
"parallelization",
"interpolation",
"physics",
"memory contention",
"protocol verification",
"computation",
"underlying complexity",
"finite fields",
"optima",
"determinantal representations",
"AF",
"control theory",
"data sets",
"infrastructure",
"symmetric linear matrix forms",
"PI research",
"attention",
"software",
"LinBox library",
"squares representation",
"Parallel Methods",
"analysis",
"symbolic computation",
"Small",
"exact sum",
"Semidefinite numerical optimization",
"Efficient Exact/Certified Symbolic Computation",
"solution",
"way",
"theorem",
"randomization",
"polynomials",
"computational algebraic complexity",
"Toyota",
"Hybrid Symbolic-Numeric",
"program",
"symbolic expressions",
"LinBox",
"modern life",
"important applications",
"squares certificates",
"understanding",
"approach",
"random intermediate problems",
"exact linear algebra",
"linear algebra problems",
"polynomial inequalities"
],
"name": "AF: Small: Efficient Exact/Certified Symbolic Computation By Hybrid Symbolic-Numeric and Parallel Methods",
"recipient": [
{
"id": "https://www.grid.ac/institutes/grid.40803.3f",
"type": "Organization"
},
{
"affiliation": {
"id": "https://www.grid.ac/institutes/grid.40803.3f",
"name": "North Carolina State University",
"type": "Organization"
},
"familyName": "Kaltofen",
"givenName": "Erich",
"id": "sg:person.013117774373.47",
"type": "Person"
},
{
"member": "sg:person.013117774373.47",
"roleName": "PI",
"type": "Role"
}
],
"sameAs": [
"https://app.dimensions.ai/details/grant/grant.3126722"
],
"sdDataset": "grants",
"sdDatePublished": "2019-03-07T12:35",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com.uberresearch.data.processor/core_data/20181219_192338/projects/base/nsf_projects_5.xml.gz",
"startDate": "2011-08-01T00:00:00Z",
"type": "MonetaryGrant",
"url": "http://www.nsf.gov/awardsearch/showAward?AWD_ID=1115772&HistoricalAwards=false"
}
]
```

Download the RDF metadata as: json-ld nt turtle xml License info

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/grant.3126722'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/grant.3126722'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/grant.3126722'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/grant.3126722'

This table displays all metadata directly associated to this object as RDF triples.

132 TRIPLES
19 PREDICATES
108 URIs
99 LITERALS
5 BLANK NODES

Subject | Predicate | Object | |
---|---|---|---|

1 | sg:grant.3126722 | schema:about | anzsrc-for:2201 |

2 | ″ | ″ | anzsrc-for:2208 |

3 | ″ | schema:amount | N3d8c71103b374d3581c381e183d1303a |

4 | ″ | schema:description | The solution of symbolic computation problems can be accelerated in at least two ways: one is to integrate limited precision floating point arithmetic on the scalars, and the other is to use parallel processes. We propose to investigate those approaches on problems in real algebraic optimization and exact linear algebra. Semidefinite numerical optimization produces sum-of-squares representations for polynomial inequalities, which express global optimality. But the representations are numeric and approximate, and exact rational certificates for the inequalities are derived via exact symbolic means, thus leading to truly hybrid symbolic-numeric algorithms. When combining floating point arithmetic and randomization, analysis of the expected condition numbers of the random intermediate problems can guarantee success. We propose to introduce fraction-free algorithms and analyze the arising determinantal condition numbers. LinBox is a C++ library for exact linear algebra. We propose to participate in the parallelization of the LinBox library by investigating problems with memory contention and by creating interactive symbolic supercomputing environments. Several related problems in computational algebraic complexity that will receive attention are: quadratic-time certificates for linear algebra problems, determinantal representation of polynomials by symmetric linear matrix forms, and interpolation of supersparse (lacunary) rational functions. The PI's research expands the infrastructure in symbolic computation and the understanding of the underlying complexity. Aside from certifying optima, exact sums-of-squares certificates have proved theorems in mathematics, physics and control theory. Some of the important applications of LinBox are sparse linear algebra over finite fields and integer Smith forms for computational topology data. The PI is making the developed software freely available. Algorithmic thinking and computation have become a cornerstone of modern science (pure and applied) and modern life. Symbolic computation programs, such as Mathematica, Maple, and the SAGE platform, have many applications, such as modeling data sets by symbolic expression for Toyota and Shell Oil, generating programs for signal processing, and program and protocol verification. |

5 | ″ | schema:endDate | 2015-07-31T00:00:00Z |

6 | ″ | schema:funder | https://www.grid.ac/institutes/grid.457785.c |

7 | ″ | schema:identifier | N21660128d9a6402795de1df08a651c85 |

8 | ″ | ″ | Nf8ae1ec05c884db6bd5ec9baf0bb1616 |

9 | ″ | schema:inLanguage | en |

10 | ″ | schema:keywords | AF |

11 | ″ | ″ | C++ library |

12 | ″ | ″ | Efficient Exact/Certified Symbolic Computation |

13 | ″ | ″ | Hybrid Symbolic-Numeric |

14 | ″ | ″ | LinBox |

15 | ″ | ″ | LinBox library |

16 | ″ | ″ | Maple |

17 | ″ | ″ | Mathematica |

18 | ″ | ″ | PI research |

19 | ″ | ″ | Parallel Methods |

20 | ″ | ″ | Pi |

21 | ″ | ″ | SAGE platform |

22 | ″ | ″ | Semidefinite numerical optimization |

23 | ″ | ″ | Shell Oil |

24 | ″ | ″ | Small |

25 | ″ | ″ | Toyota |

26 | ″ | ″ | algorithmic thinking |

27 | ″ | ″ | analysis |

28 | ″ | ″ | approach |

29 | ″ | ″ | attention |

30 | ″ | ″ | computation |

31 | ″ | ″ | computational algebraic complexity |

32 | ″ | ″ | computational topology data |

33 | ″ | ″ | condition number |

34 | ″ | ″ | control theory |

35 | ″ | ″ | cornerstone |

36 | ″ | ″ | data sets |

37 | ″ | ″ | determinantal condition numbers |

38 | ″ | ″ | determinantal representations |

39 | ″ | ″ | exact linear algebra |

40 | ″ | ″ | exact rational certificates |

41 | ″ | ″ | exact sum |

42 | ″ | ″ | exact symbolic means |

43 | ″ | ″ | finite fields |

44 | ″ | ″ | fraction-free algorithms |

45 | ″ | ″ | global optimality |

46 | ″ | ″ | important applications |

47 | ″ | ″ | inequality |

48 | ″ | ″ | infrastructure |

49 | ″ | ″ | integer Smith forms |

50 | ″ | ″ | interactive symbolic supercomputing environments |

51 | ″ | ″ | interpolation |

52 | ″ | ″ | limited precision |

53 | ″ | ″ | linear algebra problems |

54 | ″ | ″ | many applications |

55 | ″ | ″ | mathematics |

56 | ″ | ″ | memory contention |

57 | ″ | ″ | modern life |

58 | ″ | ″ | modern science |

59 | ″ | ″ | optima |

60 | ″ | ″ | parallel processes |

61 | ″ | ″ | parallelization |

62 | ″ | ″ | physics |

63 | ″ | ″ | point arithmetic |

64 | ″ | ″ | polynomial inequalities |

65 | ″ | ″ | polynomials |

66 | ″ | ″ | problem |

67 | ″ | ″ | program |

68 | ″ | ″ | protocol verification |

69 | ″ | ″ | quadratic-time certificates |

70 | ″ | ″ | random intermediate problems |

71 | ″ | ″ | randomization |

72 | ″ | ″ | rational functions |

73 | ″ | ″ | real algebraic optimization |

74 | ″ | ″ | representation |

75 | ″ | ″ | scalar |

76 | ″ | ″ | signal processing |

77 | ″ | ″ | software |

78 | ″ | ″ | solution |

79 | ″ | ″ | sparse linear algebra |

80 | ″ | ″ | squares certificates |

81 | ″ | ″ | squares representation |

82 | ″ | ″ | success |

83 | ″ | ″ | sum |

84 | ″ | ″ | supersparse |

85 | ″ | ″ | symbolic computation |

86 | ″ | ″ | symbolic computation problems |

87 | ″ | ″ | symbolic computation program |

88 | ″ | ″ | symbolic expressions |

89 | ″ | ″ | symbolic-numeric algorithms |

90 | ″ | ″ | symmetric linear matrix forms |

91 | ″ | ″ | theorem |

92 | ″ | ″ | underlying complexity |

93 | ″ | ″ | understanding |

94 | ″ | ″ | way |

95 | ″ | schema:name | AF: Small: Efficient Exact/Certified Symbolic Computation By Hybrid Symbolic-Numeric and Parallel Methods |

96 | ″ | schema:recipient | Nab7cac85e7174454ae008085ed256a8b |

97 | ″ | ″ | sg:person.013117774373.47 |

98 | ″ | ″ | https://www.grid.ac/institutes/grid.40803.3f |

99 | ″ | schema:sameAs | https://app.dimensions.ai/details/grant/grant.3126722 |

100 | ″ | schema:sdDatePublished | 2019-03-07T12:35 |

101 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |

102 | ″ | schema:sdPublisher | Nc0db96745526499f9000d02f4cc9e6b1 |

103 | ″ | schema:startDate | 2011-08-01T00:00:00Z |

104 | ″ | schema:url | http://www.nsf.gov/awardsearch/showAward?AWD_ID=1115772&HistoricalAwards=false |

105 | ″ | sgo:license | sg:explorer/license/ |

106 | ″ | sgo:sdDataset | grants |

107 | ″ | rdf:type | schema:MonetaryGrant |

108 | N21660128d9a6402795de1df08a651c85 | schema:name | nsf_id |

109 | ″ | schema:value | 1115772 |

110 | ″ | rdf:type | schema:PropertyValue |

111 | N3d8c71103b374d3581c381e183d1303a | schema:currency | USD |

112 | ″ | schema:value | 425000 |

113 | ″ | rdf:type | schema:MonetaryAmount |

114 | Nab7cac85e7174454ae008085ed256a8b | schema:member | sg:person.013117774373.47 |

115 | ″ | schema:roleName | PI |

116 | ″ | rdf:type | schema:Role |

117 | Nc0db96745526499f9000d02f4cc9e6b1 | schema:name | Springer Nature - SN SciGraph project |

118 | ″ | rdf:type | schema:Organization |

119 | Nf8ae1ec05c884db6bd5ec9baf0bb1616 | schema:name | dimensions_id |

120 | ″ | schema:value | 3126722 |

121 | ″ | rdf:type | schema:PropertyValue |

122 | anzsrc-for:2201 | schema:inDefinedTermSet | anzsrc-for: |

123 | ″ | rdf:type | schema:DefinedTerm |

124 | anzsrc-for:2208 | schema:inDefinedTermSet | anzsrc-for: |

125 | ″ | rdf:type | schema:DefinedTerm |

126 | sg:person.013117774373.47 | schema:affiliation | https://www.grid.ac/institutes/grid.40803.3f |

127 | ″ | schema:familyName | Kaltofen |

128 | ″ | schema:givenName | Erich |

129 | ″ | rdf:type | schema:Person |

130 | https://www.grid.ac/institutes/grid.40803.3f | schema:name | North Carolina State University |

131 | ″ | rdf:type | schema:Organization |

132 | https://www.grid.ac/institutes/grid.457785.c | ″ | schema:Organization |