Journal of Approximation Theory
- Journal of Approximation Theory
Infobox Journal
title = Journal of Approximation Theory
discipline = mathematics
abbreviation = "J. Approx. Theory"
publisher = Elsevier
country = U.S.
ISSN = 0021-9045
CODEN = JAXTAZ
history = 1968 to present
website = http://www.math.ohio-state.edu/JAT/
The Journal of Approximation Theory is "devoted to advances in pure and applied approximation theory and related areas." [cite web | url = http://www.elsevier.com/wps/find/journaldescription.cws_home/622853/description#description | title = Journal of Approximation Theory - Elsevier | accessdate = 2007-04-30]
External links
* [http://www.math.ohio-state.edu/JAT/ Journal of Approximation Theory web site]
References
Wikimedia Foundation.
2010.
Look at other dictionaries:
Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on … Wikipedia
East Journal on Approximations — Infobox Journal discipline = mathematics abbreviation = East J. Approx. publisher = DARBA country = Bulgaria ISSN =1310 6236 history = 1995 to present website = http://www.darba eja.com/The East Journal on Approximations is a journal about… … Wikipedia
Theory of cognitive development — The Theory of Cognitive Development (one of the most historically influential theories) was developed by Jean Piaget, a Swiss Philosopher (1896–1980). His genetic epistemological theory provided many central concepts in the field of developmental … Wikipedia
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Constructive Approximation — Abbreviated title (ISO) Constr. Approx. Discipline mathematics … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
