نتایج جستجو برای: analytic procedure
تعداد نتایج: 682509 فیلتر نتایج به سال:
A simple analytic design procedure for bireciprocal lattice wave digital filters (bireciprocal LWDFs) is presented with approximate linear phase. The design is started by replacing the odd order all-pass filter branch in the bireciprocal LWDF with a pure delay, leaving the other branch as an all-pass even function of z . Analytic design procedure is then formulated. Several design examples usin...
We identify a wide family of analytic sequent calculi for propositional non-classical logics whose derivability problem can be uniformly reduced to SAT. The proposed reduction is based on interpreting these calculi using non-deterministic semantics. Its time complexity is polynomial, and, in fact, linear for a useful subfamily. We further study an extension of such calculi with Next operators, ...
Analytic solutions for Burgers equations with source terms, possibly stiff, represent an important element to assess numerical schemes. Here we present a procedure, based on the characteristic technique to obtain analytic solutions for these equations with smooth initial conditions.
We give complete sequent-like tableau systems for the modal logics KB , KDB , K5, and KD5. Analytic cut rules are used to obtain the completeness. The systems have the analytic superformula property and can thus give a decision procedure.
We give complete sequent-like tableau systems for the modal logics KB, KDB, K5, and KD5. Analytic cut rules are used to obtain the completeness. The systems have the analytic superformula property and can thus give a decision procedure.
in this paper, we apply the local fractional adomian decomposition and variational iteration methods to obtain the analytic approximate solutions of fredholm integral equations of the second kind within local fractional derivative operators. the iteration procedure is based on local fractional derivative. the obtained results reveal that the proposed methods are very efficient and simple tools ...
Just as the Bernstein basis and Be Âzier points give us tools to manipulate polynomials, the Poisson basis and control points provide a new framework for investigating analytic functions. Using the Poisson representation, two different subdivision algorithms for analytic functions can be derived as extensions of the Be Âzier polynomial subdivision algorithm. The ®rst procedure generates an appr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید