When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Discounting - Wikipedia

    en.wikipedia.org/wiki/Discounting

    In the case where the only discount rate one has is not a zero-rate (neither taken from a zero-coupon bond nor converted from a swap rate to a zero-rate through bootstrapping) but an annually-compounded rate (for example if the benchmark is a US Treasury bond with annual coupons) and one only has its yield to maturity, one would use an annually ...

  3. Bootstrapping (finance) - Wikipedia

    en.wikipedia.org/wiki/Bootstrapping_(finance)

    In finance, bootstrapping is a method for constructing a (zero-coupon) fixed-income yield curve from the prices of a set of coupon-bearing products, e.g. bonds and swaps. [ 1 ] A bootstrapped curve , correspondingly, is one where the prices of the instruments used as an input to the curve, will be an exact output , when these same instruments ...

  4. Bond valuation - Wikipedia

    en.wikipedia.org/wiki/Bond_valuation

    Bond valuation is the process by which an investor arrives at an estimate of the theoretical fair value, or intrinsic worth, of a bond.As with any security or capital investment, the theoretical fair value of a bond is the present value of the stream of cash flows it is expected to generate.

  5. Direct multiple shooting method - Wikipedia

    en.wikipedia.org/.../Direct_multiple_shooting_method

    Thus, solutions of the boundary value problem correspond to solutions of the following system of N equations: (;,) = (;,) = (;,) =. The central N−2 equations are the matching conditions, and the first and last equations are the conditions y(t a) = y a and y(t b) = y b from the boundary value problem. The multiple shooting method solves the ...

  6. Finite difference methods for option pricing - Wikipedia

    en.wikipedia.org/wiki/Finite_difference_methods...

    As above, these methods can solve derivative pricing problems that have, in general, the same level of complexity as those problems solved by tree approaches, [1] but, given their relative complexity, are usually employed only when other approaches are inappropriate; an example here, being changing interest rates and / or time linked dividend policy.

  7. Greedy algorithm - Wikipedia

    en.wikipedia.org/wiki/Greedy_algorithm

    A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. [1] In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time.

  8. Investment-grade bonds vs. high-yield bonds: How they differ

    www.aol.com/finance/investment-grade-bonds-vs...

    Pros and cons of investment-grade bonds vs. high-yield. These two classes of bonds have both differences and similarities. For example, when it comes to income potential, you will earn a smaller ...

  9. Secant method - Wikipedia

    en.wikipedia.org/wiki/Secant_method

    The secant method can be interpreted as a method in which the derivative is replaced by an approximation and is thus a quasi-Newton method. If we compare Newton's method with the secant method, we see that Newton's method converges faster (order 2 against order the golden ratio φ ≈ 1.6). [2]