One-way multigrid algorithms and their optimality for a class of fixed-point problems

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3190

Full metadata record

DC Field	Value	Language
dc.contributor	Chow, Chee-Seng.	-
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:34:51Z	-
dc.date	2003-04-29T15:34:51Z	-
dc.date	1990	-
dc.date.accessioned	2013-06-04T16:16:20Z	-
dc.date.available	2013-06-04T16:16:20Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3190	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Chee-Seng Chow, John N. Tsitsiklis.	-
dc.description	Caption title.	-
dc.description	Includes bibliographical references (p. 14).	-
dc.description	Research supported by the NSF. ECS-8552419 Research supported by the ARO. DAAL03-86-K-0171 Research supported by Bellcore and Du Pont.	-
dc.format	14 p.	-
dc.format	1289355 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 1960	-
dc.subject	TK7855.M41 E3845 no.1960	-
dc.title	One-way multigrid algorithms and their optimality for a class of fixed-point problems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI