2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

21 - 30 of 33 results for: CME ; Currently searching autumn courses. You can expand your search to include all quarters

CME 300: First Year Seminar Series

Required for first-year ICME Ph.D. students; recommended for first-year ICME M.S. students. Presentations about research at Stanford by faculty and researchers from Engineering, H&S, and organizations external to Stanford. May be repeated for credit.
Terms: Aut, Win, Spr | Units: 1 | Repeatable for credit | Grading: Satisfactory/No Credit

CME 302: Numerical Linear Algebra

Solution of linear systems, accuracy, stability, LU, Cholesky, QR, least squares problems, singular value decomposition, eigenvalue computation, iterative methods, Krylov subspace, Lanczos and Arnoldi processes, conjugate gradient, GMRES, direct methods for sparse matrices. Prerequisites: CME 108, MATH 114, MATH 104.
Terms: Aut | Units: 3 | Grading: Letter or Credit/No Credit

CME 303: Partial Differential Equations of Applied Mathematics (MATH 220)

First-order partial differential equations; method of characteristics; weak solutions; elliptic, parabolic, and hyperbolic equations; Fourier transform; Fourier series; and eigenvalue problems. Prerequisite: Basic coursework in multivariable calculus and ordinary differential equations, and some prior experience with a proof-based treatment of the material as in Math 171 or Math 61CM (formerly Math 51H).
Terms: Aut | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Ryzhik, L. (PI)

CME 309: Randomized Algorithms and Probabilistic Analysis (CS 265)

Randomness pervades the natural processes around us, from the formation of networks, to genetic recombination, to quantum physics. Randomness is also a powerful tool that can be leveraged to create algorithms and data structures which, in many cases, are more efficient and simpler than their deterministic counterparts. This course covers the key tools of probabilistic analysis, and application of these tools to understand the behaviors of random processes and algorithms. Emphasis is on theoretical foundations, though we will apply this theory broadly, discussing applications in machine learning and data analysis, networking, and systems. Topics include tail bounds, the probabilistic method, Markov chains, and martingales, with applications to analyzing random graphs, metric embeddings, random walks, and a host of powerful and elegant randomized algorithms. Prerequisites: CS 161 and STAT 116, or equivalents and instructor consent.
Terms: Aut | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Valiant, G. (PI)

CME 330: Applied Mathematics in the Chemical and Biological Sciences (CHEMENG 300)

Mathematical solution methods via applied problems including chemical reaction sequences, mass and heat transfer in chemical reactors, quantum mechanics, fluid mechanics of reacting systems, and chromatography. Topics include generalized vector space theory, linear operator theory with eigenvalue methods, phase plane methods, perturbation theory (regular and singular), solution of parabolic and elliptic partial differential equations, and transform methods (Laplace and Fourier). Prerequisites: CME 102/ ENGR 155A and CME 104/ ENGR 155B, or equivalents.
Terms: Aut | Units: 3 | Grading: Letter (ABCD/NP)

CME 390: Curricular Practical Training

Educational opportunities in high technology research and development labs in applied mathematics. Qualified ICME students engage in internship work and integrate that work into their academic program. Students register during the quarter they are employed and complete a research report outlining their work activity, problems investigated, results, and follow-on projects they expect to perform. May be repeated three times for credit.
Terms: Aut, Win, Spr, Sum | Units: 1 | Repeatable for credit | Grading: Satisfactory/No Credit

CME 399: Special Research Topics in Computational and Mathematical Engineering

Graduate-level research work not related to report, thesis, or dissertation. May be repeated for credit.
Terms: Aut, Win, Spr, Sum | Units: 1-15 | Repeatable for credit | Grading: Letter or Credit/No Credit

CME 400: Ph.D. Research

Terms: Aut, Win, Spr, Sum | Units: 1-15 | Repeatable for credit | Grading: Satisfactory/No Credit

CME 444: Computational Consulting

Advice by graduate students under supervision of ICME faculty. Weekly briefings with faculty adviser and associated faculty to discuss ongoing consultancy projects and evaluate solutions. May be repeated for credit.
Terms: Aut, Win, Spr | Units: 1-3 | Repeatable for credit | Grading: Satisfactory/No Credit

CME 500: Departmental Seminar

Weekly research lectures by doctoral students, experts from academia, national laboratories, and industry. May be repeated for credit.
Terms: Aut, Win, Spr | Units: 1 | Repeatable for credit | Grading: Satisfactory/No Credit
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints