Fast and Stable Photochromic Oxazines.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast matrix multiplication is stable

We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63–72]. As a consequence of our analysis, we show that the exponent of matrix multiplication (the optimal running time) can be achieved by numerically stable algorithms. We also s...

متن کامل

Fluorescent and photochromic bifunctional molecular switch based on a stable crystalline metal-viologen complex.

An air-stable photoresponsive viologen molecular system is constructed based on a three-fold accordion interpenetrating packing arrangement. The fluorescent modulation process is coupled with a photochromic reaction via energy and electron transfer between the adjacent donor and acceptor groups.

متن کامل

Fast linear algebra is stable

In [23] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be done by any algorithm in O(n) operations for any η > 0, then it can be done stably in O(n) operations for any η > 0. Here we extend this result to show that essentially all standard linear algebra operations, includin...

متن کامل

Fast distributed almost stable marriages

In their seminal work on the Stable Marriage Problem, Gale and Shapley [3] describe an algorithm which finds a stable marriage in O(n) communication rounds. Their algorithm has a natural interpretation as a distributed algorithm where each player is represented by a single processor. The complexity measure of such a distributed algorithm is typically measured by the round complexity, assuming a...

متن کامل

Fast and Stable Unitary Qr Algorithm

A fast Fortran implementation of a variant of Gragg’s unitary Hessenberg QR algorithm is presented. It is proved, moreover, that all QRand QZ-like algorithms for the unitary eigenvalue problems are equivalent. The algorithm is backward stable. Numerical experiments are presented that confirm the backward stability and compare the speed and accuracy of this algorithm with other methods.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Organic Chemistry

سال: 2006

ISSN: 0022-3263,1520-6904

DOI: 10.1021/jo060921d