| Record ID | marc_oregon_summit_records/catalog_files/osu_bibs.mrc:1551943194:1805 |
| Source | Oregon Libraries |
| Download Link | /show-records/marc_oregon_summit_records/catalog_files/osu_bibs.mrc:1551943194:1805?format=raw |
LEADER: 01805nam a2200445Ka 4500
001 62364817
003 OCoLC
005 20051129090139.0
007 he bmb024bbca
008 051129s1989 cau b f000 0 eng d
035 $a(GPO)99181769
037 $aN 90-24008$bNASA
040 $aGPO$cGPO$dMvI
049 $aORE1
074 $a0830-H-14 (MF)
074 $a0830-H-14 (online)
086 0 $aNAS 1.26:181465
086 0 $aNAS 1.26:181465
100 1 $aFischer, Bernd,$d1957-
245 10 $aChebyshev polynomials are not always optimal$h[microform] /$cBernd Fischer, Roland Freund.
260 $a[Moffett Field, CA] :$bResearch Institute for Advanced Computer Science, NASA Ames Research Center ;$a[Springfield, Va. :$bNational Technical Information Service, distributor,$c1989]
300 $a1 v.
440 0 $aRIACS technical report ;$v89-17.
440 0 $aNASA contractor report ;$vNASA CR-181465.
533 $aMicrofiche.$b[Washington, D.C. :$cNational Aeronautics and Space Administration,$d1990].$e1 microfiche.
530 $aAlso available via Internet from the NASA Technical Report Server web site. Address as of 11/28/05: http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19900014692%5F1990014692.pdf; current access available via PURL.
650 7 $aChebyshev approximation.$2nasat.
650 7 $aIteration.$2nasat.
650 7 $aMatrices (Mathematics)$2nasat.
650 7 $aPolynomials.$2nasat.
700 1 $aFreund, Roland W.
710 2 $aResearch Institute for Advanced Computer Science (U.S.)
710 2 $aAmes Research Center.
856 41 $uhttp://purl.access.gpo.gov/GPO/LPS65322
907 $a.b23978855$bmulti$cv
902 $a060302
998 $b2$c060118$dm$ea$fv$g0
937 $aAssessment exclusion record.
945 $lvdonf$e1
945 $lngen $e1